A family of second-order methods for convex ...-regularized optimization
(ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image).This paper is concerned with the minimization of an objective that is the sum of a convex function f and an ... regularization term. Our interest is in active-set methods that incorporate second-order information about the f...
Gespeichert in:
Veröffentlicht in: | Mathematical programming 2016-09, Vol.159 (1-2), p.435-467 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | (ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image).This paper is concerned with the minimization of an objective that is the sum of a convex function f and an ... regularization term. Our interest is in active-set methods that incorporate second-order information about the function f to accelerate convergence. We describe a semismooth Newton framework that can be used to generate a variety of second-order methods, including block active set methods, orthant-based methods and a second-order iterative soft-thresholding method. The paper proposes a new active set method that performs multiple changes in the active manifold estimate at every iteration, and employs a mechanism for correcting these estimates, when needed. This corrective mechanism is also evaluated in an orthant-based method. Numerical tests comparing the performance of three active set methods are presented. |
---|---|
ISSN: | 0025-5610 1436-4646 |
DOI: | 10.1007/s10107-015-0965-3 |