Sparse approximation in lattices and semigroups

DOI10.1007/978-3-031-93112-3_27MaRDI QIDQ6880121zbMATH OpenFDO

Authors Stefan Kuhlmann, Timm Oertel, Robert Weismantel

Publication date 22 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-93112-3_27

Mathematics Subject Classification ID

Number theory (11-XX)

Cites work

• A decomposition theorem for partially ordered sets
• A mathematical introduction to compressive sensing
• A total-value greedy heuristic for the integer knapsack problem
• An algebraic perspective on integer sparse recovery
• Carathéodory bounds for integer cones
• Compressed sensing
• Computing the Continuous Discretely
• Decoding by Linear Programming
• scientific article; zbMATH DE number 3987367 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• On Kellogg's diophantine problem.
• On the recovery of an integer vector from linear measurements
• On unique recovery of finite-valued integer signals and admissible lattices of sparse hypercubes
• On-line bin packing ? A restricted survey
• PROMP: a sparse recovery approach to lattice-valued signals
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse representation of vectors in lattices and semigroups
• Sparse Solutions of Linear Diophantine Equations
• Stable signal recovery from incomplete and inaccurate measurements
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• The two-dimensional cutting stock problem revisited
• Underapproximation by Egyptian fractions

This page was built for publication: Sparse approximation in lattices and semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880121)