A smoothing Newton method for the minimum norm solution of linear program

In this paper, we propose a smoothing Newton method to find the minimum norm solution of linear program problems. By using the smoothing technique, we reformulate the problem as an unconstrained minimization problem with a twice continuous differentiable objective function. The minimization of this objective function can be carried out by the classical Newton-type method which is shown to be globally convergence.