A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone

DOI10.1007/s00245-005-0823-4zbMath1087.65064OpenAlexW2080436273MaRDI QIDQ814939

Fengming Ma, Zhang, Jianzhong, Y. J. Wang

Publication date: 8 February 2006

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

Full work available at URL: https://doi.org/10.1007/s00245-005-0823-4

zbMATH Keywords

numerical examplesnonlinear complementarity problemsuperlinear convergenceLevenberg-Marquardt algorithm

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 (20)

An optimization model and method for supply chain equilibrium management problem ⋮ A NEURAL NETWORK FOR THE GENERALIZED NONLINEAR COMPLEMENTARITY PROBLEM OVER A POLYHEDRAL CONE ⋮ Smoothing Newton method for generalized complementarity problems based on a new smoothing function ⋮ Nonmonotone smoothing Broyden-like method for generalized nonlinear complementarity problems ⋮ Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone ⋮ A complementarity model and algorithm for multi-commodity flow supply chain network equilibrium with random demands ⋮ Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem ⋮ A smoothing inexact Newton method for generalized nonlinear complementarity problem ⋮ A new Jacobian-like method for the polyhedral cone-constrained eigenvalue problem ⋮ An improvement of global error bound for the generalized nonlinear complementarity problem over a polyhedral cone ⋮ Generalized Tensor Complementarity Problems Over a Polyhedral Cone ⋮ A smoothing Newton-type method for generalized nonlinear complementarity problem ⋮ A sharper global error bound for the generalized nonlinear complementarity problem over a polyhedral cone ⋮ A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions ⋮ Quadratic optimization over a polyhedral cone ⋮ Global error bound for the generalized linear complementarity problem over a polyhedral cone ⋮ Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones ⋮ An improvement on the global error bound estimation for ELCP and its applications ⋮ Generalized polynomial complementarity problems over a polyhedral cone ⋮ A smooth Newton method with 3-1 piecewise NCP function for generalized nonlinear complementarity problem

This page was built for publication: A nonsmooth L-M method for solving the generalized nonlinear complementarity problem over a polyhedral cone