Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing |
scientific article |
Statements
Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (English)
0 references
25 November 2014
0 references
The authors propose, analyze and test a new practical algorithm to solve the separable nonsmooth minimization problem consisting of an \(\ell_1\)-norm regularized term and a continuously differentiable term. This type of problem mainly appears in signal/image processing, compressive sensing, machine learning, and linear inverse problem. However, the problem is challenging because of the non-smoothness of the regularization term. For various practical problems, either the computing efforts of the Hessian matrices are very expensive or the evaluation of the Hessian is difficult, the Hessian is not even available analytically. These challenges lead to the quasi-Newton method, which generates a series of Hessian approximation through the use of the gradient while maintaining a fast rate of convergence.
0 references
nonsmooth optimization
0 references
nonconvex optimization
0 references
Barzilai-Borwein gradient algorithm
0 references
nonmonotone line search
0 references
\(\ell_1\) regularization
0 references
compressive sensing
0 references
gradient algorithm
0 references
iteration
0 references
numerical experiments
0 references
smooth term
0 references
globally convergent
0 references
quasi-Newton method
0 references
Hessian approximation
0 references
positive components
0 references
0 references
0 references
0 references
0 references
0 references