Complexity of optimizing over the integers
Amitabh Basu

TL;DR
This paper introduces a unified framework for analyzing the complexity of optimization problems, bridging continuous and discrete cases, and applies it to mixed-integer convex optimization to foster cross-disciplinary understanding.
Contribution
It develops a general formalism for complexity in optimization, unifying continuous and discrete cases, and studies mixed-integer convex optimization within this framework.
Findings
Unified complexity framework for optimization problems
Analysis of mixed-integer convex optimization complexity
Bridging continuous and discrete optimization communities
Abstract
In the first part of this paper, we present a unified framework for analyzing the algorithmic complexity of any optimization problem, whether it be continuous or discrete in nature. This helps to formalize notions like "input", "size" and "complexity" in the context of general mathematical optimization, avoiding context dependent definitions which is one of the sources of difference in the treatment of complexity within continuous and discrete optimization. In the second part of the paper, we employ the language developed in the first part to study information theoretic and algorithmic complexity of {\em mixed-integer convex optimization}, which contains as a special case continuous convex optimization on the one hand and pure integer optimization on the other. We strive for the maximum possible generality in our exposition. We hope that this paper contains material that both…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Complexity and Algorithms in Graphs · Machine Learning and Algorithms
