Mathematical Programming: Series A and B
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
Nonlinear complementarity as unconstrained and constrained minimization
Mathematical Programming: Series A and B - Special issue: Festschrift in Honor of Philip Wolfe part II: studies in nonlinear programming
On stationary points of the implicit Lagrangian for nonlinear complementarity problems
Journal of Optimization Theory and Applications
A class of smoothing functions for nonlinear and mixed complementarity problems
Computational Optimization and Applications
On the resolution of monotone complementarity problems
Computational Optimization and Applications
Nonlinear complementarity as unconstrained optimization
Journal of Optimization Theory and Applications
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
Solution of monotone complementarity problems with locally Lipschitzian functions
Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
A Comparison of Large Scale Mixed Complementarity Problem Solvers
Computational Optimization and Applications
A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
SIAM Journal on Control and Optimization
Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems
SIAM Journal on Control and Optimization
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part II
A smoothing Newton method for general nonlinear complementarity problems
Computational Optimization and Applications - Special issue on nonsmooth and smoothing methods
A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
SIAM Journal on Optimization
A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
SIAM Journal on Optimization
Journal of Global Optimization
Complementarity: Applications, Algorithms and Extensions (Applied Optimization)
Complementarity: Applications, Algorithms and Extensions (Applied Optimization)
A family of NCP functions and a descent method for the nonlinear complementarity problem
Computational Optimization and Applications
Journal of Computational and Applied Mathematics
Information Sciences: an International Journal
A non-interior continuation algorithm for the CP based on a generalized smoothing function
Journal of Computational and Applied Mathematics
| Hi-index | 7.30 |
We consider a regularization method for nonlinear complementarity problems with F being a P"0-function which replaces the original problem with a sequence of the regularized complementarity problems. In this paper, this sequence of regularized complementarity problems are solved approximately by applying the generalized Newton method for an equivalent augmented system of equations, constructed by the generalized Fischer-Burmeister (FB) NCP-functions @f"p with p1. We test the performance of the regularization semismooth Newton method based on the family of NCP-functions through solving all test problems from MCPLIB. Numerical experiments indicate that the method associated with a smaller p, for example p@?[1.1,2], usually has better numerical performance, and the generalized FB functions @f"p with p@?[1.1,2) can be used as the substitutions for the FB function @f"2.