Barrier Algorithms for Constrained Non-Convex Optimization
arxiv(2024)
摘要
In this paper we theoretically show that interior-point methods based on
self-concordant barriers possess favorable global complexity beyond their
standard application area of convex optimization. To do that we propose first-
and second-order methods for non-convex optimization problems with general
convex set constraints and linear constraints. Our methods attain a suitably
defined class of approximate first- or second-order KKT points with the
worst-case iteration complexity similar to unconstrained problems, namely
O(ε^-2) (first-order) and O(ε^-3/2) (second-order),
respectively.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要