works on
convex optimization 1cutting-plane methods 1first-order oracles 1information complexity 1lower bounds 1mixed-integer programming 1

From the 1 of 1 linked paper with an AI index.

collaborators

1 paper

math.OC2026

Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization

Amitabh Basu, Phillip Kerger, Marco Molinaro

The paper proves that solving mixed-integer convex optimization with bit‑wise first‑order oracles requires a number of bits that grows quadratically with the number of continuous v…