A smoothing method for sparse optimization over convex sets
From MaRDI portal
Publication:2191281
DOI10.1007/s11590-019-01408-xzbMath1445.90106OpenAlexW2917542583WikidataQ128385065 ScholiaQ128385065MaRDI QIDQ2191281
Publication date: 24 June 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01408-x
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- DC approximation approaches for sparse optimization
- A note on the complexity of \(L _{p }\) minimization
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- Concave programming for minimizing the zero-norm over polyhedral sets
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Smoothing methods for nonlinear complementarity problems
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
- Solving absolute value equation using complementarity and smoothing functions
- A concave optimization-based approach for sparse portfolio selection
- Exact Penalty Decomposition Method for Zero-Norm Minimization Based on MPEC Formulation
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Compressed sensing and best 𝑘-term approximation
- Concave programming for finding sparse solutions to problems with convex constraints
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Sparse representations in unions of bases
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- Gradient Pursuits
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- 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
- 10.1162/153244303322753751
- Sparse Approximate Solutions to Linear Systems
- A New Computational Method for the Sparsest Solutions to Systems of Linear Equations
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Convex Analysis
- Compressed sensing
- The elements of statistical learning. Data mining, inference, and prediction
