Optimizing Sparsity over Lattices and Semigroups

DOI10.1007/978-3-030-45771-6_4zbMath1503.90073arXiv1912.09763OpenAlexW3023233216MaRDI QIDQ5041733

Timm Oertel, Jesús A. De Loera, Gennadiy Averkov, Iskander M. Aliev

Publication date: 14 October 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

boundspolynomial time algorithmsnon-zero entries of a solution

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Generalized flatness constants, spanning lattice polytopes, and the Gromov width, The Distributions of Functions Related to Parametric Integer Optimization, On sparse geometry of numbers, Distance-Sparsity Transference for Vertices of Corner Polyhedra, Sparse representation of vectors in lattices and semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the recovery of an integer vector from linear measurements
• Matching structure and the matching lattice
• Lattice translates of a polytope and the Frobenius problem
• PROMP: a sparse recovery approach to lattice-valued signals
• Complexity of the Frobenius problem
• An algebraic perspective on integer sparse recovery
• Sparsity of integer solutions in the average case
• Carathéodory bounds for integer cones
• On the Size of Lattice Simplices with a Single Interior Lattice Point
• A Survey of Compressed Sensing
• Decoding by Linear Programming
• Short rational generating functions for lattice point problems
• The Support of Integer Optimal Solutions
• Spatial Compressive Sensing for MIMO Radar
• Sparse Approximate Solutions to Linear Systems
• Stable signal recovery from incomplete and inaccurate measurements
• Sparse Solutions of Linear Diophantine Equations