Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms

DOI10.1007/S001860400384zbMath1066.90127OpenAlexW2068798347MaRDI QIDQ1774596

Zheng-Hai Huang

Publication date: 17 May 2005

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

Full work available at URL: https://doi.org/10.1007/s001860400384

zbMATH Keywords

Global convergenceNonlinear complementarity problemMaximally complementary solutionNon-interior-point smoothing algorithm

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (21)

Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP ⋮ Unified smoothing functions for absolute value equation associated with second-order cone ⋮ An inexact smoothing method for the monotone complementarity problem over symmetric cones ⋮ A smoothing Newton algorithm for weighted linear complementarity problem ⋮ Smoothing Newton method for generalized complementarity problems based on a new smoothing function ⋮ A new path-following algorithm for nonlinear \(P_*\) complementarity problems ⋮ A predictor-corrector smoothing Newton method for symmetric cone complementarity problems ⋮ A note on quadratic convergence of a smoothing Newton algorithm for the LCP ⋮ A smoothing inexact Newton method for variational inequality problems ⋮ A smoothing-type algorithm for solving system of inequalities ⋮ A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs ⋮ Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem ⋮ Numerical comparisons based on four smoothing functions for absolute value equation ⋮ Formulating an \(n\)-person noncooperative game as a tensor complementarity problem ⋮ A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties ⋮ Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem ⋮ Tensor complementarity problems. II: Solution methods ⋮ A revised cut-peak function method for box constrained continuous global optimization ⋮ A new class of neural networks for NCPs using smooth perturbations of the natural residual function ⋮ Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search ⋮ A smoothing Newton method with a mixed line search for monotone weighted complementarity problems

This page was built for publication: Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms