Information complexity of mixed-integer convex optimization

DOI10.1007/S10107-024-02099-8MaRDI QIDQ7019078zbMATH OpenFDO

Authors Amitabh Basu, Hongyi Jiang, Phillip Kerger, Marco Molinaro

Publication date 5 March 2025

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10107-024-02099-8

zbMATH Keywords

convex optimizationinformation complexitylower boundsmixed integer optimization

Mathematics Subject Classification ID

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

Cites work

• A polynomial algorithm for minimizing discrete convic functions in fixed dimension
• 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
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• Integer conic function minimization based on the comparison oracle
• Introduction to Derivative-Free Optimization
• On the complexity of quasiconvex integer minimization problem
• Partitions of mass-distributions and of convex bodies by hyperplanes

Cited in

(1)

• Reducing the large set threshold for Oertel's conjecture on the mixed-integer volume

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

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