A regularization semismooth Newton method for P₀-NCPs with a non-monotone line search

DOI10.4208/NMTMA.2012.M10027MaRDI QIDQ4901607zbMATH OpenOpenAlexFDO

Authors Li-Yong Lu, Wei-Zhe Gu, Wei Wang

Publication date 24 January 2013

Published in Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/nmtma.2012.m10027

zbMATH Keywords

global convergencenon-monotone line searchnonlinear complementarity problemsemismooth Newton method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs
• A smoothing Newton method for ncps with the \(P_{0}\)-property
• The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function
• A new smoothing and regularization Newton method for \(P_{0}\)-NCP
• A regularization smoothing Newton method for solving nonlinear complementarity problem

Cited in

(3)

• Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems
• A new semismooth Newton method for NCPs based on the penalized KK function
• A regularization semismooth Newton method based on the generalized Fischer-Burmeister function for \(P_0\)-NCPs

This page was built for publication: A regularization semismooth Newton method for \(\text{P}_0\)-NCPs with a non-monotone line search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4901607)