A new computational method for the sparsest solutions to systems of linear equations
From MaRDI portal
Publication:5258945
\(\ell_0\)-minimizationbilevel optimizationconvex optimizationlinear programmingreweighted \(\ell_1\)-methodsparsest solutionsparsity recovery
Linear equations (linear algebraic aspects) (15A06) Inverse problems in linear algebra (15A29) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Linear programming (90C05) Convex programming (90C25) Nonconvex programming, global optimization (90C26)
Recommendations
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- Algorithms on the sparse solution of under-determined linear systems
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Convergence and Stability of Iteratively Re-weighted Least Squares Algorithms
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- De-noising by soft-thresholding
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Gradient Pursuits
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 1215260 (Why is no real title available?)
- scientific article; zbMATH DE number 1465030 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- Improving the Thresholds of Sparse Recovery: An Analysis of a Two-Step Reweighted Basis Pursuit Algorithm
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Iteratively reweighted least squares minimization for sparse recovery
- Just relax: convex programming methods for identifying sparse signals in noise
- Matching pursuits with time-frequency dictionaries
- Nonlinear Perturbation of Linear Programs
- On Sparse Representations in Arbitrary Redundant Bases
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- Robust regression using iteratively reweighted least-squares
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- RSP-Based Analysis for Sparsest and Least \ell₁-Norm Solutions to Underdetermined Linear Systems
- Some remarks on greedy algorithms
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse Bayesian Learning for Basis Selection
- Sparse Recovery of Streaming Signals Using <formula formulatype="inline"><tex Notation="TeX">$\ell_1$</tex></formula>-Homotopy
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Stable signal recovery from incomplete and inaccurate measurements
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The elements of statistical learning. Data mining, inference, and prediction
- Uncertainty principles and ideal atomic decomposition
Cited in
(27)- Solving sparse linear systems by an ABS-method that corresponds to LU- decomposition
- Solving systems of linear algebraic equations of a special kind with sparse polynomial and numerical coefficients
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
- A smoothing method for sparse optimization over convex sets
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F₂
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Fast implementation of ^1-greedy algorithm
- scientific article; zbMATH DE number 6501155 (Why is no real title available?)
- scientific article; zbMATH DE number 3844929 (Why is no real title available?)
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- Microcomputer symbolic generation of an optimal Crout algorithm for sparse systems of linear equations
- scientific article; zbMATH DE number 3930235 (Why is no real title available?)
- Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
- scientific article; zbMATH DE number 1067718 (Why is no real title available?)
- Efficient Solution of a Sparse Non-symmetric System of Linear Equations
- scientific article; zbMATH DE number 1762799 (Why is no real title available?)
- A Polyhedral Method for Sparse Systems with Many Positive Solutions
- A study of sparse matrix representations for solving linear systems in a functional language
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- 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
- Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
- Joint modeling of playing time and purchase propensity in massively multiplayer online role-playing games using crossed random effects
- General decomposition pursuit algorithm for linear inverse problems
- Iteratively weighted thresholding homotopy method for the sparse solution of underdetermined linear equations
This page was built for publication: A new computational method for the sparsest solutions to systems of linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5258945)
