Strong convergence of a modified proximal algorithm for solving the lasso
From MaRDI portal
Recommendations
- Properties and iterative methods for the lasso and its variants
- The iterative method for solving the proximal split feasibility problem with an application to LASSO problem
- scientific article; zbMATH DE number 6477533
- Nonlinear iteration method for proximal split feasibility problems
- Properties and iterative methods for the \(Q\)-lasso
Cites work
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A multiprojection algorithm using Bregman projections in a product space
- Atomic Decomposition by Basis Pursuit
- Averaged mappings and the gradient-projection algorithm
- Compressed sensing
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On the auxiliary mappings generated by a family of mappings and solutions of variational inequalities problems
- Properties and iterative methods for the \(Q\)-lasso
- Quelques propriétés des opérateurs angle-bornes et n-cycliquement monotones
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery by Proximal Forward-Backward Splitting
- Stable signal recovery from incomplete and inaccurate measurements
- The multiple-sets split feasibility problem and its applications for inverse problems
- The probability of ruin in double-type insurance generalized compound Poisson risk models
- Viscosity approximation methods for fixed-points problems
- Viscosity approximation methods for nonexpansive mappings
Cited in
(3)
This page was built for publication: Strong convergence of a modified proximal algorithm for solving the lasso
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q262321)