A one-step smoothing Newton method for second-order cone programming (Q953375): Difference between revisions

The second-order cone programming problem is to minimize or maximize a linear function over the intersection of an affine space with the Cartesian product of a finite number of second-order cones. In this paper, a new smoothing function is introduced by smoothing the symmetric perturbed Fischer-Burmeister function. This new function is basis for a one-step smoothing Newton method for solving the second-order cone programming problem. The algorithm can start from an arbitrary point. Only one system of linear equations needs to be solved and only one line search is performed in each iteration. If an accumulation point of the iteration sequence satisfies a nonsingularity assumption then the iteration sequence converges to the accumulation point globally and locally Q-quadratically without strict complementarity. The efficiency of the algorithm is illustrated by some numerical experimental results on ten randomly generated test problems.