A smoothing Newton-type method for second-order cone programming problems based on a new smoothing Fischer-Burmeister function

a new smoothing function of the well known fischer-burmeister function is given. based on this new function, a smoothing newton-type method is proposed for solving second-order cone programming. at each iteration, the proposed algorithm solves only one system of linear equations and performs only one line search. this algorithm can start from an arbitrary point and it is q-quadratically convergent under a mild assumption. numerical results demonstrate the effectiveness of the algorithm. mathematical subject classification: 90c25, 90c30, 90c51, 65k05, 65y20.