A new one-step smoothing Newton method for second-order cone programming

作者：Tang, Jingyong; He, Guoping; Dong, Li^*; Fang, Liang

来源：Applications of Mathematics, 2012, 57(4): 311-331.

DOI：10.1007/s10492-012-0019-6

• second-order cone programming
• smoothing Newton method
• global convergence
• quadratic convergence

In this paper, we present a new one-step smoothing Newton method for solving the second-order cone programming (SOCP). Based on a new smoothing function of the well-known Fischer-Burmeister function, the SOCP is approximated by a family of parameterized smooth equations. Our algorithm solves only one system of linear equations and performs only one Armijo-type line search at each iteration. It can start from an arbitrary initial point and does not require the iterative points to be in the sets of strictly feasible solutions. Without requiring strict complementarity at the SOCP solution, the proposed algorithm is shown to be globally and locally quadratically convergent under suitable assumptions. Numerical experiments demonstrate the feasibility and efficiency of our algorithm.

• 出版日期2012-8
• 单位上海交通大学; 泰山学院; 山东科技大学; 信阳师范学院