Projects per year
Abstract
A class of algorithms for unconstrained optimization is introduced, which subsumes the classical trust-region algorithm and two of its newer variants, as well as the cubic and quadratic regularization methods. A unified theory of global convergence to first-order critical points is then described for this class. © 2013 Copyright Taylor and Francis Group, LLC.
Original language | English |
---|---|
Pages (from-to) | 82-95 |
Number of pages | 14 |
Journal | Optimization Methods and Software |
Volume | 28 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Feb 2013 |
Fingerprint
Dive into the research topics of 'Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization'. Together they form a unique fingerprint.Projects
- 1 Active