Updating the regularization parameter in the adaptive cubic regularization algorithm
The adaptive cubic regularization method (Cartis et al. in Math. Program. Ser. A 127(2):245–295, 2011 ; Math. Program. Ser. A. 130(2):295–319, 2011 ) has been recently proposed for solving unconstrained minimization problems. At each iteration of this method, the objective function is replaced by a cubic approximation which comprises an adaptive regularization parameter whose role is related to the local Lipschitz constant of the objective’s Hessian. We present new updating strategies for this parameter based on interpolation techniques, which improve the overall numerical performance of the algorithm. Numerical experiments on large nonlinear least-squares problems are provided. Copyright Springer Science+Business Media, LLC 2012
Volume (Year): 53 (2012)
Issue (Month): 1 (September)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/math/journal/10589|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:53:y:2012:i:1:p:1-22. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.