9781611976984 - evaluation complexity of algorithms for nonconvex optimization: theory, computation, and perspectives (mos-siam series on optimization) de cartis, coralia; gould, nicholas i. m.; toint, philippe l. (12 resultados)
Idioma: Inglés
Editorial: SIAM-Society for Industrial and Applied Mathematics, 2022
- Tapa dura
Librería: Brook Bookstore On Demand, Napoli, NA, ItaliaBrook Bookstore On Demand
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 92,26
Envío por EUR 11,00Se envía de Italia a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Condición: new.
Idioma: Inglés
Editorial: SIAM-Society for Industrial and Applied Mathematics, 2022
- Tapa dura
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 99,26
Envío por EUR 9,50Se envía de Irlanda a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: New.
Idioma: Inglés
Editorial: MP-SIA SIAM - Society for Industrial and Applied M, 2022
- Tapa dura
Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 103,08
Envío por EUR 8,88Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 5 disponibles
HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Idioma: Inglés
Editorial: Society For Industrial & Applied Mathematics,U.S., 2022
- Tapa dura
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 101,89
Envío por EUR 17,46Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: Brand New. 529 pages. 10.24x7.32x1.54 inches. In Stock.
Idioma: Inglés
Editorial: Society for Industrial & Applied Mathematics,U.S., New York, 2022
- Tapa dura
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de AmericaGrand Eagle Retail
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 123,90
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: 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 as…sumptionsand 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.
Idioma: Inglés
Editorial: Society for Industrial and Applied Mathematics,U.S., US, 2022
- Tapa dura
Librería: Rarewaves.com USA, London, LONDO, Reino UnidoRarewaves.com USA
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 127,44
Gastos de envío gratisSe envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 3 disponibles
Hardback. Condición: 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-an…d 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.
Idioma: Inglés
Editorial: SIAM-Society for Industrial and Applied Mathematics, 2022
- Tapa dura
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 122,03
Envío por EUR 7,56Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 3 disponibles
Condición: New.
Idioma: Inglés
Editorial: SIAM-Society for Industrial and Applied Mathematics, 2022
- Tapa dura
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de AmericaKennys Bookstore
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 122,47
Envío por EUR 9,06Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: New.
Idioma: Inglés
Editorial: SIAM-Society for Industrial and Applied Mathematics, 2022
- Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 136,09
Envío por EUR 13,94Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Condición: New. In English.
Idioma: Inglés
Editorial: SIAM-Society for Industrial and Applied Mathematics, 2022
- Tapa dura
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 150,62
Envío por EUR 3,44Se envía dentro de Estados Unidos de AmericaCantidad disponible: 3 disponibles
Condición: New.
Idioma: Inglés
Editorial: Society for Industrial and Applied Mathematics,U.S., US, 2022
- Tapa dura
Librería: Rarewaves.com UK, London, Reino UnidoRarewaves.com UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 123,78
Envío por EUR 75,65Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 3 disponibles
Hardback. Condición: 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-an…d 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.
Idioma: Inglés
Editorial: Society for Industrial & Applied Mathematics,U.S., New York, 2022
- Tapa dura
Librería: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 189,87
Envío por EUR 31,94Se envía de Australia a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: 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 as…sumptionsand 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.
