Properties and iterative methods for the Q-lasso
From MaRDI portal
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solution to inverse problems in abstract spaces (65J22)
Recommendations
- Properties and iterative methods for the lasso and its variants
- scientific article; zbMATH DE number 6850057
- Properties and refinements of the fused Lasso
- scientific article; zbMATH DE number 6477533
- An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising
- $l_{q}$ Sparsity Penalized Linear Regression With Cyclic Descent
- A practical scheme and fast algorithm to tune the Lasso with optimality guarantees
- The smooth-Lasso and other \(\ell _{1}+\ell _{2}\)-penalized methods
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3187170 (Why is no real title available?)
- A multiprojection algorithm using Bregman projections in a product space
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Properties and iterative methods for the lasso and its variants
- Proximity algorithms for image models: denoising
- Proximité et dualité dans un espace hilbertien
- Regularization and Variable Selection Via the Elastic Net
- 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 Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
Cited in
(13)- A modified extragradient method for variational inclusion and fixed point problems in Banach spaces
- Robust regularization theory based on \(L_q\) \((0<q<1)\) regularization: the asymptotic distribution and variable selection consistence of solutions
- New inertial proximal gradient methods for unconstrained convex optimization problems
- scientific article; zbMATH DE number 6850057 (Why is no real title available?)
- Properties and refinements of the fused Lasso
- Properties and iterative methods for the lasso and its variants
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery
- \(l_1\)-\(l_2\) regularization of split feasibility problems
- 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
- Strong convergence of a modified proximal algorithm for solving the lasso
- A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization
This page was built for publication: Properties and iterative methods for the \(Q\)-lasso
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015266)
