Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
From MaRDI portal
Publication:2976140
bilevel programmingconvex optimizationduality theorypolyhedral setsparsest pointsparsity recoverystrict complementarityweighted \(l_{1}\)-algorithm
Numerical methods involving duality (49M29) Convex functions and convex programs in convex geometry (52A41) Numerical mathematical programming methods (65K05) Linear programming (90C05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Computing a minimum weight triangulation of a sparse point set
- Geometric spanners for weighted point sets
- Geometric Spanners for Weighted Point Sets
- Approximating polyhedra with sparse inequalities
- Some lower bounds on sparse outer approximations of polytopes
- The sparsest solution of the union of finite polytopes via its nonconvex relaxation
- scientific article; zbMATH DE number 4153914
- Spanners of Additively Weighted Point Sets
- Spanners of additively weighted point sets
- A reduced fast construction of polynomial lattice point sets with low weighted star discrepancy
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Atomic Decomposition by Basis Pursuit
- Compressed sensing and best \(k\)-term approximation
- Concave programming for finding sparse solutions to problems with convex constraints
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Covariance-Preconditioned Iterative Methods for Nonnegatively Constrained Astronomical Imaging
- Decoding by Linear Programming
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications
- Exact Regularization of Convex Programs
- 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
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 1215260 (Why is no real title available?)
- Iteratively reweighted least squares minimization for sparse recovery
- Matching pursuits with time-frequency dictionaries
- Mathematical Programming for Data Mining: Formulations and Challenges
- Minimum-support solutions of polyhedral concave programs*
- Nonlinear methods of approximation
- Nonlinear Perturbation of Linear Programs
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Nonnegative matrix factorization for spectral data analysis
- On Sparse Representations in Arbitrary Redundant Bases
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Parsimonious least norm approximation
- Reweighted _1-minimization for sparse solutions to underdetermined linear systems
- RSP-Based Analysis for Sparsest and Least \ell₁-Norm Solutions to Underdetermined Linear Systems
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse Approximate Solutions to Linear Systems
- Sparse image and signal processing. Wavelets, curvelets, morphological diversity
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Theory of compressive sensing via _1-minimization: a non-RIP analysis and extensions
- Uncertainty principles and ideal atomic decomposition
- Understanding machine learning. From theory to algorithms
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
Cited in
(12)- 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
- A smoothing method for sparse optimization over convex sets
- Newton-type optimal thresholding algorithms 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
- A new computational method for the sparsest solutions to systems of linear equations
- Heuristics for Finding Sparse Solutions of Linear Inequalities
- 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
- Splitting alternating algorithms for sparse solutions of linear systems with concatenated orthogonal matrices
This page was built for publication: Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976140)
