Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems

Authors:
Francisco Facchinei;Christian Kanzow
Affiliations:
-;-
Venue:
SIAM Journal on Control and Optimization
Year:
1999

Citing 0
Cited 17

Existence and Limiting Behavior of Trajectories Associatedwith P0-equations

Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
A primal-dual algorithm for minimizing a sum of Euclidean norms

Journal of Computational and Applied Mathematics
Merit Functions for Complementarity and Related Problems: A Survey

Computational Optimization and Applications
A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions

Mathematics of Operations Research
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems

Computational Optimization and Applications
Applications of smoothing methods in numerical analysis and optimization

Focus on computational neurobiology
Smooth Convex Approximation to the Maximum Eigenvalue Function

Journal of Global Optimization
A New Path-Following Algorithm for Nonlinear P*Complementarity Problems

Computational Optimization and Applications
A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming

Computational Optimization and Applications
The convergence of a one-step smoothing Newton method for P0-NCP based on a new smoothing NCP-function

Journal of Computational and Applied Mathematics
A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for P0-NCPs

Journal of Computational and Applied Mathematics
A variant smoothing Newton method for P0-NCP based on a new smoothing function

Journal of Computational and Applied Mathematics
A regularized smoothing-type algorithm for solving a system of inequalities with a P0-function

Journal of Computational and Applied Mathematics
Smoothing algorithms for complementarity problems over symmetric cones

Computational Optimization and Applications
A new smoothing and regularization Newton method for P0-NCP

Journal of Global Optimization
Nonmonotone equilibrium problems: coercivity conditions and weak regularization

Journal of Global Optimization
Sufficient conditions on nonemptiness and boundedness of the solution set of the P0 function nonlinear complementarity problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regularization methods for the solution of nonlinear complementarity problems are standard methods for the solution of monotone complementarity problems and possess strong convergence properties. In this paper, we replace the monotonicity assumption by a P0-function condition. We show that many properties of regularization methods still hold for this larger class of problems. However, we also provide some counterexamples which indicate that not all results carry over from monotone to P0-function complementarity problems.