Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
From MaRDI portal
Publication:2976140
DOI10.1287/MOOR.2016.0791zbMATH Open1359.90072OpenAlexW2526012566MaRDI QIDQ2976140FDOQ2976140
Authors: Zhi-Quan Luo, Yun-Bin Zhao 
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
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
convex optimizationbilevel programmingduality theorypolyhedral setstrict complementaritysparsity recoverysparsest pointweighted \(l_{1}\)-algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29) Convex functions and convex programs in convex geometry (52A41)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Atomic Decomposition by Basis Pursuit
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Matching pursuits with time-frequency dictionaries
- Decoding by Linear Programming
- Understanding machine learning. From theory to algorithms
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and redundant representations. From theory to applications in signal and image processing.
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Compressed sensing and best \(k\)-term approximation
- On Sparse Representations in Arbitrary Redundant Bases
- Greed is Good: Algorithmic Results for Sparse Approximation
- Uncertainty principles and ideal atomic decomposition
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Reweighted \(\ell_1\)-minimization for sparse solutions to underdetermined linear systems
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Nonlinear methods of approximation
- Iteratively reweighted least squares minimization for sparse recovery
- Sparse Approximate Solutions to Linear Systems
- Sparse image and signal processing. Wavelets, curvelets, morphological diversity
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Minimum-support solutions of polyhedral concave programs*
- Parsimonious least norm approximation
- Title not available (Why is that?)
- Covariance-Preconditioned Iterative Methods for Nonnegatively Constrained Astronomical Imaging
- On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Mathematical Programming for Data Mining: Formulations and Challenges
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- 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
- A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
- Concave programming for finding sparse solutions to problems with convex constraints
- Nonlinear Perturbation of Linear Programs
- Nonnegative matrix factorization for spectral data analysis
- Fast and Accurate Algorithms for Re-Weighted $\ell _{1}$-Norm Minimization
Cited In (11)
- Newton-type optimal thresholding algorithms for sparse optimization problems
- Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
- Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems
- Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere
- Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming
- Heuristics for Finding Sparse Solutions of Linear Inequalities
- Scaled proximal gradient methods for sparse optimization problems
- Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
- A smoothing method for sparse optimization over convex sets
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems
- A new computational method for the sparsest solutions to systems of linear equations
Uses Software
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)
