科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we propose a Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization using the arc-search strategy. The proposed algorithm searches for optimizers along the ellipses that approximate the central path and ensures that the duality gap and the infeasibility have the same rate of decline. By analyzing, we obtain the iteration complexity O(r log epsilon(-1)) for the Nesterov-Todd direction, where r is the rank of the associated Euclidean Jordan algebra and epsilon is the required precision. To our knowledge, the obtained complexity bounds coincide with the currently best known theoretical complexity bounds for infeasible symmetric optimization.
- 出版日期2017-11-21
- 单位河南师范大学
