NCP Functions Applied to Lagrangian Globalization for the Nonlinear Complementarity Problem

Authors:
Liquin Qi;Yu-Fei Yang
Affiliations:
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong (e-mail: maqilq@polyu.edu.hk);College of Mathematics and Econometrics, Hunan University, Chang-sha, P.R. China
Venue:
Journal of Global Optimization
Year:
2002

Citing 13
Cited 3

Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications

Mathematical Programming: Series A and B
A nonsmooth version of Newton's method

Mathematical Programming: Series A and B
A semismooth equation approach to the solution of nonlinear complementarity problems

Mathematical Programming: Series A and B
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
Global methods for nonlinear complementarity problems

Mathematics of Operations Research
New NCP-functions and their properties

Journal of Optimization Theory and Applications
Engineering and Economic Applications of Complementarity Problems

SIAM Review
Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities

Mathematics of Computation
On NCP-Functions

Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part II
A New Unconstrained Differentiable Merit Function for Box Constrained Variational Inequality Problems and a Damped Gauss--Newton Method

SIAM Journal on Optimization
Jacobian Smoothing Methods for Nonlinear Complementarity Problems

SIAM Journal on Optimization
Lagrangian globalization methods for nonlinear complementarity problems

Journal of Optimization Theory and Applications

The Lagrangian Globalization Method for Nonsmooth Constrained Equations

Computational Optimization and Applications
A smoothing inexact Newton method for nonlinear complementarity problems

Journal of Computational and Applied Mathematics
A new filled function method for an unconstrained nonlinear equation

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on NCP functions, we present a Lagrangian globalization (LG) algorithm model for solving the nonlinear complementarity problem. In particular, this algorithm model does not depend on some specific NCP function. Under several theoretical assumptions on NCP functions we prove that the algorithm model is well-defined and globally convergent. Several NCP functions applicable to the LG-method are analyzed in details and shown to satisfy these assumptions. Furthermore, we identify not only the properties of NCP functions which enable them to be used in the LG method but also their properties which enable the strict complementarity condition to be removed from the convergence conditions of the LG method. Moreover, we construct a new NCP function which possesses some favourable properties.