Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
From MaRDI portal
Publication:2976140
DOI10.1287/moor.2016.0791zbMath1359.90072OpenAlexW2526012566MaRDI QIDQ2976140
Publication date: 13 April 2017
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2016.0791
convex optimizationstrict complementarityduality theorybilevel programmingpolyhedral setsparsity recoverysparsest pointweighted \(l_{1}\)-algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Convex functions and convex programs in convex geometry (52A41)
Related Items
Newton-type optimal thresholding algorithms for sparse optimization problems, Heuristics for Finding Sparse Solutions of Linear Inequalities, A smoothing method for sparse optimization over convex sets, Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems, Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming, Scaled proximal gradient methods for sparse optimization problems, Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere, Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems, 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
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Parsimonious least norm approximation
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Nonlinear methods of approximation
- Nonnegative matrix factorization for spectral data analysis
- Compressed sensing and best 𝑘-term approximation
- Concave programming for finding sparse solutions to problems with convex constraints
- Exact Regularization of Convex Programs
- On Sparse Representations in Arbitrary Redundant Bases
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and Redundant Representations
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Iteratively reweighted least squares minimization for sparse recovery
- Nonlinear Perturbation of Linear Programs
- Atomic Decomposition by Basis Pursuit
- Minimum-support solutions of polyhedral concave programs*
- Uncertainty principles and ideal atomic decomposition
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
- 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
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Sparse Approximate Solutions to Linear Systems
- Matching pursuits with time-frequency dictionaries
- Reweighted $\ell_1$-Minimization for Sparse Solutions to Underdetermined Linear Systems
- Mathematical Programming for Data Mining: Formulations and Challenges
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Covariance-Preconditioned Iterative Methods for Nonnegatively Constrained Astronomical Imaging
- Understanding Machine Learning
- Sparse Image and Signal Processing
