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...
| Main Authors: | , , |
|---|---|
| 格式: | Conference item |
| 出版: |
World Scientific
2018
|