论文标题
短期方法不是强烈的多项式时间
Short-step Methods Are Not Strongly Polynomial-Time
论文作者
论文摘要
短期方法是解决凸的约束优化问题的重要类别。在这篇简短的论文中，我们表明，在非常温和的假设下，$ \ ell_2 $ -neighbourhood的宽度和宽度，任何短期的内点方法都不是强烈的多项式时间。
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 $\ell_2$-neighbourhood, any short-step interior-point method is not strongly polynomial-time.
