Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives 9781611976984

Варианты приобретения

Цена: 12415.00р.
Кол-во:
о цене
Наличие: Отсутствует.
Возможна поставка под заказ. Дата поступления на склад уточняется после оформления заказа

Добавить в корзину

в Мои желания

Автор: Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint
Название: Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives
ISBN: 9781611976984
Издательство: Mare Nostrum (Eurospan)
Классификация:

Вычислительная математика

Оптимизация

Прикладная математика

Математическая теория вычислений

ISBN-10: 1611976987
Обложка/Формат: Hardback
Страницы: 529
Вес: 1.36 кг.
Дата издания: 30.08.2022
Серия: Mos-siam series on optimization
Язык: English
Размер: 181 x 259 x 25
Ключевые слова: Applied mathematics,Mathematical theory of computation,Numerical analysis,Optimization
Подзаголовок: Theory, computation, and perspectives
Рейтинг:
Поставляется из: Англии
Описание: 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—and 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.
Дополнительное описание: Applied mathematics|Optimization|Mathematical theory of computation|Numerical analysis

Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives, Coralia Cartis, Nicholas I. M. Gould, Philippe L. Toint