Smoothing Newton method for NCP with the identification of degenerate indices

DOI10.1016/j.cam.2010.05.004zbMath1210.65121OpenAlexW1965586499MaRDI QIDQ989148

Haodong Yu, Pu, Dingguo

Publication date: 27 August 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.05.004

zbMATH Keywords

global convergencenumerical examplesnonlinear complementarity problemsdegenerate indicesactive set strategysmoothing methodslocal superlinear convergenceleast square approachreduced Gauss-Newton algorithm for semi-smooth functionssmoothing NCP-function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Related Items

A new active-set strategy for NCP with degenerate solutions ⋮ An active-set Levenberg-Marquardt method for degenerate nonlinear complementarity problem under local error bound conditions ⋮ A new class of smoothing functions and a smoothing Newton method for complementarity problems ⋮ A nonmonotone Jacobian smoothing inexact Newton method for NCP

Cites Work

• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• An accelerated Newton method for equations with semismooth jacobians and nonlinear complementarity problems
• A smoothing Levenberg-Marquardt method for the extended linear complementarity problem
• A smoothing conic trust region filter method for the nonlinear complementarity problem
• A QP-free constrained Newton-type method for variational inequality problems
• Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
• Solution of monotone complementarity problems with locally Lipschitzian functions
• A semismooth equation approach to the solution of nonlinear complementarity problems
• A reduction method for variational inequalities
• A feasible semismooth asymptotically Newton method for mixed complementarity problems
• On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm
• A penalized Fischer-Burmeister NCP-function
• Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
• A regularization Newton method for solving nonlinear complementarity problems
• A smoothing Newton method for general nonlinear complementarity problems
• A smoothing Levenberg-Marquardt method for NCP
• The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem
• Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• Strongly Regular Generalized Equations
• Regularity Properties of a Semismooth Reformulation of Variational Inequalities
• On the Accurate Identification of Active Constraints
• Engineering and Economic Applications of Complementarity Problems
• Jacobian Smoothing Methods for Nonlinear Complementarity Problems
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example
• A Class of Active-Set Newton Methods for Mixed ComplementarityProblems