• Corpus ID: 238634162

Complexity of optimizing over the integers

  title={Complexity of optimizing over the integers},
  author={Amitabh Basu},
  • A. Basu
  • Published 12 October 2021
  • Computer Science, Mathematics
  • ArXiv
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… 


Integer Convex Minimization in Low Dimensions
In this dissertation we discuss several approaches to solve integer and mixedinteger convex minimization problems. That is, we try to minimize a convex function over a convex set with the additional
Integer programming, lattice algorithms, and deterministic volume estimation
The main subject of this thesis is the development of new geometric tools and techniques for solving classic problems within the geometry of numbers and convex geometry. At a high level, the problems
Complexity Theory of Real Functions
  • K. Ko
  • Mathematics, Computer Science
    Progress in Theoretical Computer Science
  • 1991
" polynomial complexity theory extends the notions and tools of the theory of computability to provide a solid theoretical foundation for the study of computational complexity of practical problems.
Complexity of integer quasiconvex polynomial optimization
The complexity-result improves the algorithm given by Khachiyan and Porkolab for integer optimization on convex semialgebraic sets and represents a direct generalization of Lenstra's algorithm in integer linear optimization.
On the complexity of branching proofs
It is demonstrated that any branching proof can be recompiled so that the normals of the disjunctions have coefficients of size at most (nR)O(n2), where R ∈ N is the radius of an l1 ball containing K, while increasing the number of nodes in the branching tree by at most a factor O(n).
Convex Optimization: Algorithms and Complexity
This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms and provides a gentle introduction to structural optimization with FISTA, saddle-point mirror prox, Nemirovski's alternative to Nesterov's smoothing, and a concise description of interior point methods.
Fine-grained complexity of integer programming: The case of bounded branch-width and rank
This work provides evidence that the running times of known pseudo-polynomial time algorithms solving IP, when the number of constraints is a constant and the branch-width of the corresponding column-matroid is a constants, are probably optimal.
On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines
We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as JVP-complete
An Algorithmic Theory of Integer Programming
It is shown that integer programming can be solved in time, and a strongly-polynomial algorithm is derived, that is, with running time $g(a,d)\textrm{poly}(n)$, independent of the rest of the input data.
A Brief History of Linear and Mixed-Integer Programming Computation
To this day the simplex algorithm remains a primary computational tool in linear and mixed-integer programming (MIP) and George Dantzig’s key contribution to LP computation is not open to debate.