Information complexity of mixed-integer convex optimization

DOI10.1007/978-3-031-32726-1_1arXiv2308.11153MaRDI QIDQ6085983

Marco Molinaro, Hongyi Jiang, Amitabh Basu, Phillip Kerger

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/2308.11153

zbMATH Keywords

information complexitymixed-integer optimization

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11)

Cites Work

• Unnamed Item
• Partitions of mass-distributions and of convex bodies by hyperplanes
• On parallel complexity of nonsmooth convex optimization
• Algorithms for approximate calculation of the minimum of a convex function from its values
• Centerpoints: A Link between Optimization and Convex Geometry
• Complexity of optimizing over the integers

This page was built for publication: Information complexity of mixed-integer convex optimization