Properties and iterative methods for the Q-lasso
DOI10.1155/2013/250943zbMATH Open1359.94052OpenAlexW2014475680WikidataQ58915678 ScholiaQ58915678MaRDI QIDQ2015266FDOQ2015266
Authors: M. A. Alghamdi, Mohammad Ali Alghamdi, Nazeer Shahzad, Hong-Kun Xu 
Publication date: 23 June 2014
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/250943
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
- 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
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)
Cites Work
- Title not available (Why is that?)
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Atomic Decomposition by Basis Pursuit
- Regularization and Variable Selection Via the Elastic Net
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- 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?)
- Properties and iterative methods for the lasso and its variants
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
Cited In (12)
- General viscosity iterative approximation for solving unconstrained convex optimization problems
- Strong convergence of a modified proximal algorithm for solving the lasso
- STRONG CONVERGENCE OF A GENERAL VISCOSITY EXPLICIT RULE FOR THE SUM OF TWO MONOTONE OPERATORS IN HILBERT SPACES
- A new self-adaptive CQ algorithm with an application to the LASSO problem
- Properties and iterative methods for the lasso and its variants
- New inertial proximal gradient methods for unconstrained convex optimization problems
- A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization
- A modified extragradient method for variational inclusion and fixed point problems in Banach spaces
- Properties and refinements of the fused Lasso
- Proximal methods for reweighted \(l_Q\)-regularization of sparse signal recovery
- Title not available (Why is that?)
- \(l_1\)-\(l_2\) regularization of split feasibility problems
Uses Software
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)
