Strong convergence of a modified proximal algorithm for solving the lasso
From MaRDI portal
Publication:262321
DOI10.1186/s13660-015-0680-xzbMath1384.90095OpenAlexW2100839196WikidataQ59435216 ScholiaQ59435216MaRDI QIDQ262321
Publication date: 29 March 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-015-0680-x
Ridge regression; shrinkage estimators (Lasso) (62J07) Linear regression; mixed models (62J05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods for variational inequalities and related problems (65K15)
Uses Software
Cites Work
- Averaged mappings and the gradient-projection algorithm
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- A multiprojection algorithm using Bregman projections in a product space
- Viscosity approximation methods for nonexpansive mappings
- Viscosity approximation methods for fixed-points problems
- Properties and iterative methods for the \(Q\)-lasso
- On the auxiliary mappings generated by a family of mappings and solutions of variational inequalities problems
- The multiple-sets split feasibility problem and its applications for inverse problems
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Atomic Decomposition by Basis Pursuit
- Signal Recovery by Proximal Forward-Backward Splitting
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strong convergence of a modified proximal algorithm for solving the lasso