Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance

DOI10.1109/TSP.2015.2496367zbMath1412.94020MaRDI QIDQ4618248

Jordan Ninin, Hervé Carfantan, Sébastien Bourguignon, Marcel Mongeau

Publication date: 7 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

Optimality conditions for sparse nonlinear programming, Global optimization for sparse solution of least squares problems, Sparse signal reconstruction via collaborative neurodynamic optimization, A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization, Distributed primal outer approximation algorithm for sparse convex programming with separable structures, New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem, Blind Source Separation Based on Mixed Integer Programming, A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem, Feasibility pump algorithm for sparse representation under Laplacian noise, Provably optimal sparse solutions to overdetermined linear systems with non-negativity constraints in a least-squares sense by implicit enumeration, Group Sparse Optimization for Images Recovery Using Capped Folded Concave Functions