Complexity of optimizing over the integers
Complexity of optimizing over the integers
复制标题
整数优化的复杂性
DOI:
10.1007/s10107-022-01862-z
复制
发表时间:
2022
影响因子:
2.7
通讯作者:
Basu, Amitabh
中科院分区:
文献类型:
--
作者:
Basu, Amitabh
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 ofmixed-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 continuous optimizers and discrete optimizers find new and interesting, even though almost all of the material presented is common knowledge in one or the other community. We see the main merit of this paper as 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. In fact, our motivation behind Part I of the paper is to provide a common language for both communities.
登录
查看更多内容
DOI:
--
发表时间:
2012
期刊:
MOS-SIAM Series on Optimization
影响因子:
--
作者:
J. D. Loera;R. Hemmecke;M. Köppe
通讯作者:
M. Köppe
DOI:
--
发表时间:
2019
期刊:
arXiv.org
影响因子:
--
作者:
F. Eisenbrand;Christoph Hunkenschröder;Kim;Martin Koutecký;Asaf Levin;S. Onn
通讯作者:
S. Onn
影响因子:
2.7
作者:
Joseph Paat;Miriam Schlöter;R. Weismantel
通讯作者:
R. Weismantel
影响因子:
2.7
作者:
Timm Oertel
通讯作者:
Timm Oertel
影响因子:
0.6
作者:
Jean
通讯作者:
Jean