Properties and iterative methods for the lasso and its variants
From MaRDI portal
Publication:741471
DOI10.1007/S11401-014-0829-9zbMATH Open1295.47064OpenAlexW1987875610MaRDI QIDQ741471FDOQ741471
Authors: Hong-Kun Xu 
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
Recommendations
- Properties and iterative methods for the \(Q\)-lasso
- scientific article
- Strong convergence of a modified proximal algorithm for solving the lasso
- A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization
- The iterative method for solving the proximal split feasibility problem with an application to LASSO problem
dual methodlassoelastic netsparsityprojectionthresholdingproximal method\(\ell_ 1\) regularizationsmooth-lasso
Nonlinear ill-posed problems (47J06) Iterative procedures involving nonlinear operators (47J25) Variational inequalities (49J40) Inverse problems in optimal control (49N45) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22)
Cites Work
- Title not available (Why is that?)
- 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
- Sparse inverse covariance estimation with the graphical lasso
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Signal Recovery by Proximal Forward-Backward Splitting
- Proximity algorithms for image models: denoising
- Proximité et dualité dans un espace hilbertien
- Title not available (Why is that?)
- Averaged mappings and the gradient-projection algorithm
- Convergence of generalized proximal point algorithms
- The smooth-Lasso and other \(\ell _{1}+\ell _{2}\)-penalized methods
Cited In (40)
- An inertial Censor-Segal algorithm for split common fixed-point problems
- Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
- 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
- General viscosity iterative approximation for solving unconstrained convex optimization problems
- Strong convergence of a modified proximal algorithm for solving the lasso
- A viscosity-proximal gradient method with inertial extrapolation for solving certain minimization problems in Hilbert space.
- SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality
- STRONG CONVERGENCE OF A GENERAL VISCOSITY EXPLICIT RULE FOR THE SUM OF TWO MONOTONE OPERATORS IN HILBERT SPACES
- Primal-dual fixed point methods for regularized least-squares problems
- Title not available (Why is that?)
- Convergence analysis for solving equilibrium problems and split feasibility problems in Hilbert spaces
- Weak convergence theorems on the split common fixed point problem for demicontractive continuous mappings
- Strong convergence of the forward–backward splitting method with multiple parameters in Hilbert spaces
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
- Iterative solutions of the split common fixed point problem for strictly pseudo-contractive mappings
- 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
- Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method
- New inertial proximal gradient methods for unconstrained convex optimization problems
- A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization
- Properties and iterative methods for the \(Q\)-lasso
- On split equality minimization and fixed point problems
- A new method for split common fixed-point problem without priori knowledge of operator norms
- On the role of the coefficients in the strong convergence of a general type Mann iterative scheme
- Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing
- Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems
- Iterative arrangements of the MSCFP for strictly pseudocontractive mappings
- Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- Polyak's gradient method for split feasibility problem constrained by level sets
- A modified extragradient method for variational inclusion and fixed point problems in Banach spaces
- Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
- Lasso, iterative feature selection and the correlation selector: oracle inequalities and numerical performances
- Inertial self-adaptive algorithms for solving non-smooth convex optimization problems
- An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
- Properties and refinements of the fused Lasso
- Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery
- Strong convergence of two algorithms for the split feasibility problem in Banach spaces
- A modified hybrid algorithm for solving a composite minimization problem in Banach spaces
- Perturbation resilience of proximal gradient algorithm for composite objectives
This page was built for publication: Properties and iterative methods for the lasso and its variants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741471)
