Properties and iterative methods for the lasso and its variants
From MaRDI portal
Publication:741471
DOI10.1007/s11401-014-0829-9zbMath1295.47064OpenAlexW1987875610MaRDI QIDQ741471
Publication date: 12 September 2014
Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11401-014-0829-9
projectionthresholdingproximal methodsparsitylassoelastic netdual method\(\ell_ 1\) regularizationsmooth-lasso
Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25) Nonlinear ill-posed problems (47J06) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Inverse problems in optimal control (49N45) Numerical solution to inverse problems in abstract spaces (65J22)
Related Items (33)
Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm ⋮ Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem ⋮ Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size ⋮ Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing ⋮ Weak convergence theorems on the split common fixed point problem for demicontractive continuous mappings ⋮ Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery ⋮ Iterative arrangements of the MSCFP for strictly pseudocontractive mappings ⋮ Polyak's gradient method for split feasibility problem constrained by level sets ⋮ A new method for split common fixed-point problem without priori knowledge of operator norms ⋮ Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems ⋮ Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces ⋮ Unnamed Item ⋮ Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method ⋮ Unnamed Item ⋮ Strong convergence of the forward–backward splitting method with multiple parameters in Hilbert spaces ⋮ An inertial method for split common fixed point problems in Hilbert spaces ⋮ On the shrinking projection method for the split feasibility problem in Banach spaces ⋮ Strong convergence of two algorithms for the split feasibility problem in Banach spaces ⋮ Perturbation resilience of proximal gradient algorithm for composite objectives ⋮ Properties and iterative methods for the \(Q\)-lasso ⋮ Iterative solutions of the split common fixed point problem for strictly pseudo-contractive mappings ⋮ A modified extragradient method for variational inclusion and fixed point problems in Banach spaces ⋮ A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space ⋮ Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces ⋮ On split equality minimization and fixed point problems ⋮ Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms ⋮ New inertial proximal gradient methods for unconstrained convex optimization problems ⋮ Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization ⋮ A modified hybrid algorithm for solving a composite minimization problem in Banach spaces ⋮ An inertial relaxed CQ algorithm with an application to the LASSO and elastic net ⋮ On the role of the coefficients in the strong convergence of a general type Mann iterative scheme ⋮ STRONG CONVERGENCE OF A GENERAL VISCOSITY EXPLICIT RULE FOR THE SUM OF TWO MONOTONE OPERATORS IN HILBERT SPACES ⋮ General viscosity iterative approximation for solving unconstrained convex optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Sparse inverse covariance estimation with the graphical lasso
- Averaged mappings and the gradient-projection algorithm
- Convergence of generalized proximal point algorithms
- The smooth-Lasso and other \(\ell _{1}+\ell _{2}\)-penalized methods
- Proximity algorithms for image models: denoising
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Sparsity and Smoothness Via the Fused Lasso
- Regularization and Variable Selection Via the Elastic Net
- Model Selection and Estimation in Regression with Grouped Variables
- Signal Recovery by Proximal Forward-Backward Splitting
- Stable signal recovery from incomplete and inaccurate measurements
- Proximité et dualité dans un espace hilbertien
- Compressed sensing
This page was built for publication: Properties and iterative methods for the lasso and its variants
