Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
We provide sharp worst-case evaluation complexity bounds for nonconvex minimization problems with general inexpensive constraints, i.e., problems where the cost of evaluating/enforcing of the (possibly nonconvex or even disconnected) constraints, if any, is negligible compared to that of evaluating...
Prif Awduron: | Cartis, C, Gould, N, Toint, P |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
Society for Industrial and Applied Mathematics
2020
|
Eitemau Tebyg
-
Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
gan: Cartis, C, et al.
Cyhoeddwyd: (2018) -
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
gan: Cartis, C, et al.
Cyhoeddwyd: (2012) -
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization.
gan: Cartis, C, et al.
Cyhoeddwyd: (2012) -
Complexity bounds for second-order optimality in unconstrained optimization.
gan: Cartis, C, et al.
Cyhoeddwyd: (2012) -
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems.
gan: Cartis, C, et al.
Cyhoeddwyd: (2010)