Integer Convex Minimization in Low Dimensions

@inproceedings{Oertel2014IntegerCM,
  title={Integer Convex Minimization in Low Dimensions},
  author={Timm Oertel},
  year={2014}
}
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 constraint that a small number variables must be integral. The thesis consists of four parts. In the first part we apply the Mirror-Descent Method from continuous convex optimization to the mixed-integer setting. The main feature of this method is that the number of iterations is independent of the… 
On the complexity of quasiconvex integer minimization problem
TLDR
It is shown that there is no a polynomial algorithm on log R to optimize quasiconvex functions in the ball of radius R using only the comparison oracle, and an exponential on the dimension lower bound for the oracle complexity of the conic function integer optimization problem is presented.
Minimization of Even Conic Functions on the Two-Dimensional Integral Lattice
TLDR
An efficient criterion is given for checking that given vectors of a 2-dimensional lattice are successive minima and form a basis for the lattice and it is shown that the similar Successive Minima Problem for dimension n can be solved by an algorithm with at most O ( n ) 2 n log R calls to the comparison oracle.
Centerpoints: A Link between Optimization and Convex Geometry
TLDR
A concept that generalizes several different notions of a “centerpoint” in the literature is introduced and structural results about this concept are established and efficient algorithms for computing these points are provided.
Integer Conic Function Minimization Based on the Comparison Oracle
TLDR
It is shown that the shallow separation oracle for the set K can be polynomially reduced to the comparison oracle of the function f, and that it is possible to solve a constraint minimization problem with the considered classes of functions by a randomized algorithm with \((O(n)^n \log R\) expected oracle calls.
Complexity of optimizing over the integers
TLDR
The main merit of this paper is bringing together all of this information under one unifying umbrella with the hope that this will act as yet another catalyst for more interaction across the continuous-discrete divide.

References

SHOWING 1-10 OF 90 REFERENCES
Mirror-Descent Methods in Mixed-Integer Convex Optimization
TLDR
The algorithm can be adapted to find the second best point of a purely integer convex optimization problem in two dimensions, and more generally its k-th best point, and is formulated to formulate a finite-time algorithm for mixed-integer conveX optimization.
Convex separable optimization is not much harder than linear optimization
TLDR
A general-purpose algorithm for converting procedures that solves linear programming problems that is polynomial for constraint matrices with polynomially bounded subdeterminants and an algorithm for finding a ε-accurate optimal continuous solution to the nonlinear problem.
Complexity of integer quasiconvex polynomial optimization
  • S. Heinz
  • Mathematics, Computer Science
    J. Complex.
  • 2005
Integer Optimization on Convex Semialgebraic Sets
TLDR
Lenstra's theorem on the polynomial-time solvability of linear integer programming in fixed dimension to semidefinite integer programming is extended.
Integer programming, lattice algorithms, and deterministic volume estimation
TLDR
A new 2O(n) nn time algorithm is given, which yields the fastest currently known algorithm for IP and improves on the classic works of Lenstra and Kannan, to give a new and tighter proof of the atness theorem.
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
TLDR
It is shown that the problem of minimizing a homogeneous polynomial of any fixed degree over the integer points in a bounded polyhedron in a real vector space of dimension two is solvable inPolynomial time.
An algorithmic framework for convex mixed integer nonlinear programs
A Polyhedral Frobenius Theorem with Applications to Integer Optimization
We prove a representation theorem of projections of sets of integer points by an integer matrix $W$. Our result can be seen as a polyhedral analogue of several classical and recent results related to
Solution of the Frobenius Problem and Its Generalization
This paper considers the \Frobenius problem" : Given n natural numbers a 1 ; a 2 ;.. . a n such that their greatest common divisor is 1, nd the largest natural number that is not expressible as a
...
1
2
3
4
5
...