Name
Abstract | ||
|---|---|---|
In this paper, we study the iteration complexity of cubic regularization of Newton method for solving composite minimization problems with uniformly convex objective. We introduce the notion of second-order condition number of a certain degree and justify the linear rate of convergence in a nondegenerate case for the method with an adaptive estimate of the regularization parameter. The algorithm automatically achieves the best possible global complexity bound among different problem classes of uniformly convex objective functions with Holder continuous Hessian of the smooth part of the objective. As a byproduct of our developments, we justify an intuitively plausible result that the global iteration complexity of the Newton method is always better than that of the gradient method on the class of strongly convex functions with uniformly bounded second derivative. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s10957-021-01838-7 | JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS |
Keywords | DocType | Volume |
Newton method, Cubic regularization, Global complexity bounds, Strong convexity, Uniform convexity | Journal | 189 |
Issue | ISSN | Citations |
1 | 0022-3239 | 1 |
PageRank | References | Authors |
0.37 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikita Doikov | 1 | 2 | 2.42 |
| Yurii Nesterov | 2 | 1800 | 168.77 |