Evaluation Complexity of Algorithms for Nonconvex Optimization (Hardcover)

Idioma: inglés

Editorial: Society for Industrial & Applied Mathematics,U.S., New York, 2022

1611976987 / 9781611976984

Librería: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

Vendedor de 5 estrellas

Vendedor de IberLibro desde 22 de junio de 2007

Tapa dura

Condición: Nuevo

EUR 190,91

Envío por EUR 33,02 
Se envía de Australia a Estados Unidos de America

Cantidad disponible: 1 disponible

Añadir al carrito
Devoluciones gratuitas de 30 días

Descripción del artículo del vendedor

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 assumptionsand 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.…

N° de ref. del artículo 9781611976984

Título
Evaluation Complexity of Algorithms for Nonconvex Optimization (Hardcover)
Autor
Coralia Cartis
Editorial
Society for Industrial & Applied Mathematics,U.S., New York
Año de publicación
2022
Estado
new
Encuadernación
Hardcover
Idioma
inglés
ISBN 10
1611976987
ISBN 13
9781611976984

AussieBookSeller

Truganina, VIC, Australia

Vendedor de 5 estrellas

Vendedor de IberLibro desde 22 de junio de 2007

Tarifas de envío de Australia a Estados Unidos de America

ArtículoDe 25 a 45 días hábilesDe 8 a 14 días hábiles
Primer artículoEUR 33,02EUR 39,26
Los plazos de entrega los establecen los vendedores y varían según el transportista y la ubicación. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relación con cargos adicionales para cubrir cualquier aumento en los costes de envío de los artículos.

Métodos de pago

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Información empresarial del vendedor

The Nile Group Pty Ltd

42 Apex Drive
Truganina, VIC Australia 3029