Sparse Solutions of a Class of Constrained Optimization Problems

DOI10.1287/moor.2021.1194zbMath1501.90078arXiv1907.00880OpenAlexW2996484635MaRDI QIDQ5868942

Xiaojun Chen, Lei Yang, Shuhuang Xiang

Publication date: 26 September 2022

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.00880

zbMATH Keywords

penalty methodsparse optimizationsmoothing approximationcardinality minimizationnonconvex non-Lipschitz optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (1)

Lifted stationary points of sparse optimization with complementarity constraints

Uses Software

• PDCO
• SPGL1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
• The \(L_1\) penalized LAD estimator for high dimensional linear regression
• Exact penalty and error bounds in DC programming
• A note on the complexity of \(L _{p }\) minimization
• Smoothing methods for nonsmooth, nonconvex minimization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• The sparsest solution of the union of finite polytopes via its nonconvex relaxation
• A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
• Complexity of unconstrained \(L_2 - L_p\) minimization
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Atomic Decomposition by Basis Pursuit
• $NP/CMP$ Equivalence: A Phenomenon Hidden Among Sparsity Models $l_{0}$ Minimization and $l_{p}$ Minimization for Information Processing
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• Compressed sensing and best 𝑘-term approximation
• A Constrainedℓ₁Minimization Approach to Sparse Precision Matrix Estimation
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Probing the Pareto Frontier for Basis Pursuit Solutions
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Variational Analysis
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Uncertainty principles and ideal atomic decomposition
• Sparse Reconstruction by Separable Approximation
• RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
• First-Order Methods in Optimization
• Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$
• Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere
• Weak Stability of ℓ₁-Minimization Methods in Sparse Data Reconstruction
• Stable signal recovery from incomplete and inaccurate measurements
• Penalty Methods for a Class of Non-Lipschitz Optimization Problems
• Compressed sensing

This page was built for publication: Sparse Solutions of a Class of Constrained Optimization Problems