A Combined Newton Method for Symmetric Conic Linear Programming

Abstract

We propose a combined Newton method for solving the symmetric conic linear programming based on the Chen-Harker-Kanzow-Smale smoothing function. The proposed algorithm combines the techniques used in both non-smoothing Newton methods and smoothing Newton methods. Under mild assumptions, the algorithm needs to perform at most one line search at each iteration and is shown to possess global convergence.