A new semismooth Newton method for NCPs based on the penalized KK function

DOI10.1080/00207160.2011.644542zbMath1255.90116OpenAlexW2018875986MaRDI QIDQ4903557

Jianguang Zhu, Binbin Hao, Hong-Wei Liu

Publication date: 22 January 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2011.644542

zbMATH Keywords

global convergencequadratic convergencenonlinear complementarity problemgeneralized Jacobianssemismooth Levenberg-Marquardt method

Mathematics Subject Classification ID

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

Related Items

A new branch and bound algorithm for minimax ratios problems ⋮ A new linearization technique for minimax linear fractional programming

Cites Work

• Unnamed Item
• A new class of penalized NCP-functions and its properties
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Test examples for nonlinear programming codes
• A new class of semismooth Newton-type methods for nonlinear complementarity problems
• On NCP-functions
• Nonlinear complementarity as unconstrained and constrained minimization
• Solution of monotone complementarity problems with locally Lipschitzian functions
• A semismooth equation approach to the solution of nonlinear complementarity problems
• Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
• A nonsmooth version of Newton's method
• A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
• Nonsmooth Equations: Motivation and Algorithms
• Optimization and nonsmooth analysis
• Semismooth and Semiconvex Functions in Constrained Optimization
• Solving the Nonlinear Complementarity Problem by a Homotopy Method
• Engineering and Economic Applications of Complementarity Problems
• On a semismooth least squares formulation of complementarity problems with gap reduction

This page was built for publication: A new semismooth Newton method for NCPs based on the penalized KK function