% Encoding: UTF-8
@COMMENT{BibTeX export based on data in FAU CRIS: https://cris.fau.de/}
@COMMENT{For any questions please write to cris-support@fau.de}
@incollection{faucris.263692924,
abstract = {In this paper, we address the problem of minimizing a convex function f over a convex set, with the extra constraint that some variables must be integer. This problem, even when f is a piecewise linear function, is NP-hard. We study an algorithmic approach to this problem, postponing its hardness to the realization of an oracle. If this oracle can be realized in polynomial time, then the problem can be solved in polynomial time as well. For problems with two integer variables, we show with a novel geometric construction how to implement the oracle efficiently, that is, in O(ln(B)) approximate minimizations of f over the continuous variables, where B is a known bound on the absolute value of the integer variables. Our 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. This observation allows us to formulate a finite-time algorithm for mixed-integer convex optimization.},
address = {Berlin, Heidelberg},
author = {Baes, Michel and Oertel, Timm and Wagner, Christian and Weismantel, Robert},
booktitle = {Facets of Combinatorial Optimization},
doi = {10.1007/978-3-642-38189-8{\_}5},
editor = {Michael Jünger, Gerhard Reinelt},
faupublication = {no},
isbn = {9783642381898},
keywords = {Polynomial Time; Convex Function; Convex Optimization; Feasible Point; Integer Variable},
month = {Jan},
note = {CRIS-Team Scopus Importer:2021-09-09},
pages = {101-131},
peerreviewed = {unknown},
publisher = {Springer-Verlag},
title = {{Mirror}-descent methods in mixed-integer convex optimization},
year = {2013}
}