Modified Newton-type methods for the NCP by using a class of one-parametric NCP-functions
DOI10.1186/1029-242X-2012-286zbMath1280.65058OpenAlexW2126175119WikidataQ59289807 ScholiaQ59289807MaRDI QIDQ388072
Publication date: 18 December 2013
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1029-242x-2012-286
global convergencenumerical resultsnonlinear complementarity problemsuperlinear convergencegeneralized Newton method
Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A monotone semismooth Newton type method for a class of complementarity problems
- Properties of a family of merit functions and a merit function method for the NCP
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- A comparison of large scale mixed complementarity problem solvers
- A special newton-type optimization method
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
This page was built for publication: Modified Newton-type methods for the NCP by using a class of one-parametric NCP-functions