Evaluation complexity of algorithms for nonconvex optimization : theory, computation, and perspectives

著者

    • Cartis, C. (Coralia)
    • Gould, Nicholas I. M.
    • Toint, Ph. L. (Philippe L.)

書誌事項

Evaluation complexity of algorithms for nonconvex optimization : theory, computation, and perspectives

Coralia Cartis, Nicholas I.M. Gould, Philippe L. Toint

(MOS-SIAM series on optimization, 30)

Society for Industrial and Applied Mathematics, c2022

大学図書館所蔵 件 / 2

この図書・雑誌をさがす

注記

Includes bibliographical references and indexes

Summary: "This is the go-to book for those interested in solving nonconvex problems"-- Provided by publisher

内容説明・目次

内容説明

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 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, 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.

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

ページトップへ