# Cubic regularization of Newton method and its global performance

@article{Nesterov2006CubicRO, title={Cubic regularization of Newton method and its global performance}, author={Y. Nesterov and B. Polyak}, journal={Mathematical Programming}, year={2006}, volume={108}, pages={177-205} }

In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local convergence results. However, the main contribution of the paper is related to global worst-case complexity bounds for different problem classes including some nonconvex cases. It is shown that the search direction can be computed by standard linear algebra technique.

#### Topics from this paper

#### Paper Mentions

#### 614 Citations

Modified Gauss–Newton scheme with worst case guarantees for global performance

- Mathematics, Computer Science
- Optim. Methods Softw.
- 2007

Algebraic rules for quadratic regularization of Newton’s method

- Computer Science, Mathematics
- Comput. Optim. Appl.
- 2015

On global minimizers of quadratic functions with cubic regularization

- Mathematics, Computer Science
- Optim. Lett.
- 2019

Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method

- Mathematics, Computer Science
- J. Optim. Theory Appl.
- 2021

#### References

SHOWING 1-10 OF 16 REFERENCES

Interior-point polynomial algorithms in convex programming

- Mathematics, Computer Science
- Siam studies in applied mathematics
- 1994

Iterative solution of nonlinear equations in several variables

- Computer Science, Mathematics
- Computer science and applied mathematics
- 1970

Numerical methods for unconstrained optimization and nonlinear equations

- Mathematics, Computer Science
- Prentice Hall series in computational mathematics
- 1983

Introductory lectures on convex programming: a basic course

- Introductory lectures on convex programming: a basic course
- 2004

Trust Region Methods. SIAM

- Trust Region Methods. SIAM
- 2000

Informational complexity and efficient methods for solution of convex extremal problems

- Informational complexity and efficient methods for solution of convex extremal problems
- 1983