Skip to main content alibris logo

Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives

by , ,

Write The First Customer Review
Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives - Cartis, Coralia, and Gould, Nicholas I. M., and Toint, Philippe L.
Filter Results
Item Condition
Seller Rating
Other Options
Change Currency

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

loading
Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation, and Perspectives 2022, Society for Industrial & Applied Mathematics,U.S., New York

ISBN-13: 9781611976984

Hardcover