Optimization Online


ARCq: a new Adaptive Regularization by Cubics variant

Jean-Pierre Dussault (Jean-Pierre.Dussault***at***USherbrooke.CA)

Abstract: We present a new Adaptive Regularization by Cubics (ARC) algorithm, which we name \arcq\ and which is very close in spirit to trust region methods, closer than the original ARC is. We prove global convergence to second-order critical points. We also obtain as a corollary the convergence of the original ARC method. We prove the optimal complexity property for the ARCq and identify the key elements which allow it. We end by proposing an efficient implementation using a Cholesky like factorization. Limited preliminary experimentation suggests that \arcq\ may be more robust than its trust region counterpart and that our implementation is efficient.

Keywords: Nonlinear optimization --- unconstrained optimization --- Trust region algorithms -- Adaptive cubic regularization methods

Category 1: Nonlinear Optimization (Unconstrained Optimization )


Download: [PDF]

Entry Submitted: 06/01/2015
Entry Accepted: 06/01/2015
Entry Last Modified: 10/11/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society