Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
We establish or refute the optimality of inexact second-order methods for unconstrained nonconvex optimization from the point of view of worst-case evaluation complexity, improving and generalizing the results of [15, 19]. To this aim, we consider a new general class of inexact second-order algorit...
প্রধান লেখক: | Cartis, C, Gould, NIM, Toint, PL |
---|---|
বিন্যাস: | Conference item |
প্রকাশিত: |
World Scientific
2018
|
অনুরূপ উপাদানগুলি
-
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
অনুযায়ী: Cartis, C, অন্যান্য
প্রকাশিত: (2020) -
Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients
অনুযায়ী: Cartis, C, অন্যান্য
প্রকাশিত: (2017) -
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization.
অনুযায়ী: Cartis, C, অন্যান্য
প্রকাশিত: (2012) -
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems.
অনুযায়ী: Cartis, C, অন্যান্য
প্রকাশিত: (2010) -
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
অনুযায়ী: Cartis, C, অন্যান্য
প্রকাশিত: (2012)