A New Computational Method for the Sparsest Solutions to Systems of Linear Equations
From MaRDI portal
Publication:5258945
DOI10.1137/140968240zbMath1320.65060OpenAlexW653768339MaRDI QIDQ5258945
Publication date: 24 June 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://pure-oai.bham.ac.uk/ws/files/19878056/SIOPT_096824_Final.pdf
linear programmingconvex optimizationbilevel optimizationsparsest solution\(\ell_0\)-minimizationsparsity recoveryreweighted \(\ell_1\)-method
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Linear programming (90C05) Inverse problems in linear algebra (15A29) Linear equations (linear algebraic aspects) (15A06)
Related Items
Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations, 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory, Newton-type optimal thresholding algorithms for sparse optimization problems, Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm, A smoothing method for sparse optimization over convex sets, Joint modeling of playing time and purchase propensity in massively multiplayer online role-playing games using crossed random effects, A Large-Scale Constrained Joint Modeling Approach for Predicting User Activity, Engagement, and Churn With Application to Freemium Mobile Games, Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems, Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems, Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction, Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Some remarks on greedy algorithms
- Improving the Thresholds of Sparse Recovery: An Analysis of a Two-Step Reweighted Basis Pursuit Algorithm
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Compressed sensing and best 𝑘-term approximation
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Sparse and Redundant Representations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Iteratively reweighted least squares minimization for sparse recovery
- Nonlinear Perturbation of Linear Programs
- Robust regression using iteratively reweighted least-squares
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- Gradient Pursuits
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
- Convergence and Stability of Iteratively Re-weighted Least Squares Algorithms
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- De-noising by soft-thresholding
- Matching pursuits with time-frequency dictionaries
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparse Bayesian Learning for Basis Selection
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- The elements of statistical learning. Data mining, inference, and prediction
