A Smoothing Method for Sparse Optimization over Polyhedral Sets

DOI10.1007/978-3-319-18161-5_31zbMath1370.90177OpenAlexW2265415348MaRDI QIDQ5357000

Tangi Migot, Mounir Haddou

Publication date: 12 September 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-18161-5_31

zbMATH Keywords

concave minimizationsparsitysmoothing functions\(\ell 0\)-minimization

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (6)

Solving absolute value equation using complementarity and smoothing functions ⋮ A sub-additive DC approach to the complementarity problem ⋮ Sparse approximation over the cube ⋮ A generalized direction in interior point method for monotone linear complementarity problems ⋮ The sparsest solution of the union of finite polytopes via its nonconvex relaxation ⋮ A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation

Cites Work

• Unnamed Item
• Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
• Smoothing methods for nonlinear complementarity problems
• Stable recovery of sparse overcomplete representations in the presence of noise
• On the Stable Recovery of the Sparsest Overcomplete Representations in Presence of Noise
• A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
• Logarithmic barriers for sparse matrix cones

This page was built for publication: A Smoothing Method for Sparse Optimization over Polyhedral Sets