A nonsmooth version of Newton's method
Mathematical Programming: Series A and B
Convergence analysis of some algorithms for solving nonsmooth equations
Mathematics of Operations Research
A non-interior-point continuation method for linear complementarity problems
SIAM Journal on Matrix Analysis and Applications
Smoothing methods for convex inequalities and linear complementarity problems
Mathematical Programming: Series A and B
A class of smoothing functions for nonlinear and mixed complementarity problems
Computational Optimization and Applications
Some Noninterior Continuation Methods for LinearComplementarity Problems
SIAM Journal on Matrix Analysis and Applications
A Comparison of Large Scale Mixed Complementarity Problem Solvers
Computational Optimization and Applications
Mathematics of Operations Research
Weak Univalence and Connectedness of Inverse Images of Continuous Functions
Mathematics of Operations Research
A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
SIAM Journal on Matrix Analysis and Applications
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Mathematics of Computation
Journal of Optimization Theory and Applications
Solving variational inequality problems via smoothing-nonsmooth reformulations
Journal of Computational and Applied Mathematics - Special issue on nonlinear programming and variational inequalities
A Global and Local Superlinear Continuation-Smoothing Method for P0 and R0 NCP or Monotone NCP
SIAM Journal on Optimization
Regularization of P0-Functions in Box Variational Inequality Problems
SIAM Journal on Optimization
SIAM Journal on Optimization
Smooth Approximations to Nonlinear Complementarity Problems
SIAM Journal on Optimization
Jacobian Smoothing Methods for Nonlinear Complementarity Problems
SIAM Journal on Optimization
A Smoothing Newton Method for General Nonlinear Complementarity Problems
Computational Optimization and Applications
A new approach to continuation methods for complementarity problems with uniform P-functions
Operations Research Letters
Hi-index | 0.49 |
In this paper we propose a modified one-step smoothing Newton method for solving the P0 linear complementarity problem (P0-LCP) based on Kanzow's smoothing function. Our smoothing Newton method solves only one linear system of equations and performs only one line search at each iteration. It is proved that our proposed algorithm has global convergence and local quadratic convergence in absence of strict complementarity assumption at the P0-LCP solution. Under weaker conditions, our convergence results are much stronger than many previous literatures.