Two new predictor-corrector algorithms for second-order cone programming |
| |
Authors: | You-fang Zeng Yan-qin Bai Jin-bao Jian Chun-ming Tang |
| |
Affiliation: | You-fang ZENG1,2,Yan-qin BAI1,Jin-bao JIAN2,Chun-ming TANG2(1.Department of Mathematics,Shanghai University,Shanghai 200444,P.R.China,2.College of Mathematics and Information Science,Guangxi University,Nanning 530004,P.R.China) |
| |
Abstract: | Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms, two interior-point predictor-corrector algorithms for the second-order cone programming (SOCP) are presented. The two algorithms use the Newton direction and the Euler direction as the predictor directions, respectively. The corrector directions belong to the category of the Alizadeh-Haeberly-Overton (AHO) directions. These algorithms are suitable to the cases of feasible and infeasible interior iterative points. A simpler neighborhood of the central path for the SOCP is proposed, which is the pivotal difference from other interior-point predictor-corrector algorithms. Under some assumptions, the algorithms possess the global, linear, and quadratic convergence. The complexity bound O(rln(ɛ 0/ɛ)) is obtained, where r denotes the number of the second-order cones in the SOCP problem. The numerical results show that the proposed algorithms are effective. |
| |
Keywords: | second-order cone programming infeasible interior-point algorithm predictor-corrector algorithm global convergence complexity analysis |
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录! |
|