9781611976984 - evaluation complexity of algorithms for nonconvex optimization: theory, computation, and perspectives di coralia cartis (author); nicholas i. m. gould (author) (12 risultati)
Lingua: Inglese
Editore: SIAM-Society for Industrial and Applied Mathematics, 2022
- Rilegato
Da: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 92,05
EUR 11,00 spedizioneSpedito da Italia a U.S.A.Quantità: 5 disponibili
Condizione: new.
Lingua: Inglese
Editore: SIAM-Society for Industrial and Applied Mathematics, 2022
- Rilegato
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 99,26
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 1 disponibili
Condizione: New.
Lingua: Inglese
Editore: MP-SIA SIAM - Society for Industrial and Applied M, 2022
- Rilegato
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 103,08
EUR 8,88 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 5 disponibili
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Lingua: Inglese
Editore: Society For Industrial & Applied Mathematics,U.S., 2022
- Rilegato
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 101,89
EUR 17,46 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: Brand New. 529 pages. 10.24x7.32x1.54 inches. In Stock.
Lingua: Inglese
Editore: Society for Industrial & Applied Mathematics,U.S., New York, 2022
- Rilegato
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 123,90
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: new. Hardcover. One of the most popular ways to assess the "effort" needed to solve a problem is to count how many evaluations of the problem functions (and their derivatives) are required. In many cases, this is often the dominating computational cost. Given an optimization problem satisfying reasonable a…ssumptionsand given access to problem-function values and derivatives of various degreeshow many evaluations might be required to approximately solve the problem? Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives addresses this question for nonconvex optimization problems, those that may have local minimizers and appear most often in practice. This is the first bookon complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems,to address the disadvantages of traditional optimality measures and propose useful surrogates leading to algorithms that compute approximate high-order critical points, and to compare traditional and new methods, highlighting the advantages of the latter from a complexity point of view.This is the go-to book for those interested in solving nonconvex problems. It is suitable for advanced undergraduate and graduate students in courses on Advanced Numerical Analysis, Special Topics on Numerical Analysis, Topics on Data Science, Topics on Numerical Optimization, and Topics on Approximation Theory. The first book on complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems, and to address the disadvantages of traditional optimality measures and propose useful surrogates. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics,U.S., US, 2022
- Rilegato
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 127,44
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: 3 disponibili
Hardback. Condizione: New. One of the most popular ways to assess the "effort" needed to solve a problem is to count how many evaluations of the problem functions (and their derivatives) are required. In many cases, this is often the dominating computational cost. Given an optimization problem satisfying reasonable assumptions-a…nd given access to problem-function values and derivatives of various degrees-how many evaluations might be required to approximately solve the problem? Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives addresses this question for nonconvex optimization problems, those that may have local minimizers and appear most often in practice. This is the first bookon complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems,to address the disadvantages of traditional optimality measures and propose useful surrogates leading to algorithms that compute approximate high-order critical points, and to compare traditional and new methods, highlighting the advantages of the latter from a complexity point of view.This is the go-to book for those interested in solving nonconvex problems. It is suitable for advanced undergraduate and graduate students in courses on Advanced Numerical Analysis, Special Topics on Numerical Analysis, Topics on Data Science, Topics on Numerical Optimization, and Topics on Approximation Theory.
Lingua: Inglese
Editore: SIAM-Society for Industrial and Applied Mathematics, 2022
- Rilegato
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 122,03
EUR 7,56 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 3 disponibili
Condizione: New.
Lingua: Inglese
Editore: SIAM-Society for Industrial and Applied Mathematics, 2022
- Rilegato
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 122,47
EUR 9,06 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: New.
Lingua: Inglese
Editore: SIAM-Society for Industrial and Applied Mathematics, 2022
- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 136,09
EUR 13,94 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 5 disponibili
Condizione: New. In English.
Lingua: Inglese
Editore: SIAM-Society for Industrial and Applied Mathematics, 2022
- Rilegato
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 150,62
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: 3 disponibili
Condizione: New.
Lingua: Inglese
Editore: Society for Industrial and Applied Mathematics,U.S., US, 2022
- Rilegato
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 123,78
EUR 75,65 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 3 disponibili
Hardback. Condizione: New. One of the most popular ways to assess the "effort" needed to solve a problem is to count how many evaluations of the problem functions (and their derivatives) are required. In many cases, this is often the dominating computational cost. Given an optimization problem satisfying reasonable assumptions-a…nd given access to problem-function values and derivatives of various degrees-how many evaluations might be required to approximately solve the problem? Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives addresses this question for nonconvex optimization problems, those that may have local minimizers and appear most often in practice. This is the first bookon complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems,to address the disadvantages of traditional optimality measures and propose useful surrogates leading to algorithms that compute approximate high-order critical points, and to compare traditional and new methods, highlighting the advantages of the latter from a complexity point of view.This is the go-to book for those interested in solving nonconvex problems. It is suitable for advanced undergraduate and graduate students in courses on Advanced Numerical Analysis, Special Topics on Numerical Analysis, Topics on Data Science, Topics on Numerical Optimization, and Topics on Approximation Theory.
Lingua: Inglese
Editore: Society for Industrial & Applied Mathematics,U.S., New York, 2022
- Rilegato
Da: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 189,87
EUR 31,94 spedizioneSpedito da Australia a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: new. Hardcover. One of the most popular ways to assess the "effort" needed to solve a problem is to count how many evaluations of the problem functions (and their derivatives) are required. In many cases, this is often the dominating computational cost. Given an optimization problem satisfying reasonable a…ssumptionsand given access to problem-function values and derivatives of various degreeshow many evaluations might be required to approximately solve the problem? Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives addresses this question for nonconvex optimization problems, those that may have local minimizers and appear most often in practice. This is the first bookon complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems,to address the disadvantages of traditional optimality measures and propose useful surrogates leading to algorithms that compute approximate high-order critical points, and to compare traditional and new methods, highlighting the advantages of the latter from a complexity point of view.This is the go-to book for those interested in solving nonconvex problems. It is suitable for advanced undergraduate and graduate students in courses on Advanced Numerical Analysis, Special Topics on Numerical Analysis, Topics on Data Science, Topics on Numerical Optimization, and Topics on Approximation Theory. The first book on complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems, and to address the disadvantages of traditional optimality measures and propose useful surrogates. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
