Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results (2009)

First Author: Cartis C

Attributed to:  Algorithms for Large-Scale Nonlinearly Constrained Optimization funded by EPSRC

Abstract

An Adaptive Regularisation algorithm using Cubics (ARC) is proposed for unconstrained optimization, generalizing at the same time an unpublished method due to Griewank (Technical Report NA/12, 1981, DAMTP, University of Cambridge), an algorithm by Nesterov and Polyak (Math Program 108(1):177-205, 2006) and a proposal by Weiser et al. (Optim Methods Softw 22(3):413-431, 2007). At each iteration of our approach, an approximate global minimizer of a local cubic regularisation of the objective function is determined, and this ensures a significant improvement in the objective so long as the Hessian of the objective is locally Lipschitz continuous. The new method uses an adaptive estimation of the local Lipschitz constant and approximations to the global model-minimizer which remain computationally-viable even for large-scale problems. We show that the excellent global and local convergence properties obtained by Nesterov and Polyak are retained, and sometimes extended to a wider class of problems, by our ARC approach. Preliminary numerical experiments with small-scale test problems from the CUTEr set show encouraging performance of the ARC algorithm when compared to a basic trust-region implementation. © 2009 Springer and Mathematical Programming Society.

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/s10107-009-0286-5

Publication URI: http://dx.doi.org/10.1007/s10107-009-0286-5

Type: Journal Article/Review

Volume: 127

Parent Publication: Mathematical Programming

Issue: 2