Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems

DOI10.1287/moor.24.2.440zbMath0977.90064OpenAlexW2123534004MaRDI QIDQ2757604

Liqun Qi

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.24.2.440

zbMATH Keywords

global convergencevariational inequalityquadratic convergencegeneralized Newton methodnonlinear complementarity

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (16)

On almost smooth functions and piecewise smooth functions ⋮ Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization ⋮ A Finsler geometrical programming approach to the nonlinear complementarity problem of traffic equilibrium ⋮ A Newton-type algorithm for solving problems of search theory ⋮ A new modified one-step smoothing Newton method for solving the general mixed complementarity problem ⋮ Active-set projected trust-region algorithm for box-constrained nonsmooth equations ⋮ Solving nonlinear complementarity problems with neural networks: A reformulation method approach ⋮ A smoothing Newton method for semi-infinite programming ⋮ Boundedness and regularity properties of semismooth reformulations of variational inequalities ⋮ Smoothing Newton method for NCP with the identification of degenerate indices ⋮ Solving a class of variational inequalities with inexact oracle operators ⋮ Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems ⋮ Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations ⋮ An unconstrained smooth minimization reformulation of the second-order cone complementarity problem ⋮ An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations ⋮ A smoothing Broyden-like method for the mixed complementarity problems

This page was built for publication: Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems