Short-step Methods Are Not Strongly Polynomial-Time
Optimization and Control
2022-01-11 v1
Abstract
Short-step methods are an important class of algorithms for solving convex constrained optimization problems. In this short paper, we show that under very mild assumptions on the self-concordant barrier and the width of the -neighbourhood, any short-step interior-point method is not strongly polynomial-time.
Cite
@article{arxiv.2201.02768,
title = {Short-step Methods Are Not Strongly Polynomial-Time},
author = {Manru Zong and Yin Tat Lee and Man-Chung Yue},
journal= {arXiv preprint arXiv:2201.02768},
year = {2022}
}