A family of second-order methods for convex \(\ell _1\)-regularized optimization (Q312690): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: CUTE / rank | |||
Normal rank |
Revision as of 22:07, 28 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A family of second-order methods for convex \(\ell _1\)-regularized optimization |
scientific article |
Statements
A family of second-order methods for convex \(\ell _1\)-regularized optimization (English)
0 references
16 September 2016
0 references
The paper deals with the minimization of a convex objective function augmented with an \(L_1\) regularization term, and to this end it proposes a new Block Active-Set (BAS) method which involves multiple changes in the active manifold estimate at every estimation step. The basic BAS method is firstly described, and the authors propose a new block active-set algorithm to rectify some failures caused by the definition of the matrix involved in the quadratic form of the function to optimize. Modified versions of the orthant method are proposed, and a numerical example illustrates the efficiency of the method compared with other ones (FISTA for example).
0 references
convex optimization
0 references
\(\ell _1\)-regularization
0 references
block active set method
0 references
semismooth Newton method
0 references
quadratic problems
0 references
second-order methods
0 references
orthant based method
0 references