Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results |
scientific article |
Statements
Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (English)
0 references
11 May 2011
0 references
The paper is concerned with a general cubic regularization framework for unconstrained optimization which has roots in earlier algorithms. It contains a thorough introduction to relevant contributions and presents an appropriate list of references on this subject. The authors consider the convergence properties. The framework allows for the approximate solution of the key step calculation. Preliminary numerical experiments with small-scale problems are reported. For Part II see [Math. Program. 130, No. 2 (A), 295--319 (2011; Zbl 1229.90193)].
0 references
nonlinear optimization
0 references
unconstrained optimization
0 references
cubic regularization
0 references
Newton's method
0 references
trust-region methods
0 references
global convergence
0 references
local convergence
0 references
