Sparse approximation over the cube
From MaRDI portal
Publication:6085987
DOI10.1007/978-3-031-32726-1_4arXiv2210.02738OpenAlexW4377200015MaRDI QIDQ6085987
Sabrina Bruckmeier, Christoph Hunkenschröder, Robert Weismantel
Publication date: 9 November 2023
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.02738
Cites Work
- 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\)
- Concave programming for minimizing the zero-norm over polyhedral sets
- A general solution to least squares problems with box constraints and its applications
- Restricted strong convexity implies weak submodularity
- A polynomial case of the cardinality-constrained quadratic optimization problem
- A note on the hardness of sparse approximation
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Atomic Decomposition by Basis Pursuit
- A concave optimization-based approach for sparse portfolio selection
- Concave programming for finding sparse solutions to problems with convex constraints
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Greed is Good: Algorithmic Results for Sparse Approximation
- Minimum-support solutions of polyhedral concave programs*
- On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem
- Subset Selection in Sparse Matrices
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- A polynomial algorithm for best-subset selection problem
- A Smoothing Method for Sparse Optimization over Polyhedral Sets
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sparse approximation over the cube
