A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone

DOI10.1016/j.amc.2004.09.057zbMath1080.65052OpenAlexW2026985827MaRDI QIDQ2572346

Fengming Ma, Xinzhen Zhang, Y. J. Wang

Publication date: 16 November 2005

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

Full work available at URL: https://doi.org/10.1016/j.amc.2004.09.057

zbMATH Keywords

convergencenumerical examplespolyhedral coneNewton-type algorithmgeneralized linear complementarity problemFisher function

Mathematics Subject Classification ID

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)

Related Items

An optimization model and method for supply chain equilibrium management problem ⋮ Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone ⋮ 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 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 ⋮ Error bound analysis for vector equilibrium problems with partial order provided by 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 ⋮ Generalized polynomial complementarity problems over a polyhedral cone

Cites Work

• Unnamed Item
• Unnamed Item
• A Newton method for a class of quasi-variational inequalities
• On the resolution of monotone complementarity problems
• Minimization of \(SC^ 1\) functions and the Maratos effect
• Smoothing methods for convex inequalities and linear complementarity problems
• Equivalence of the generalized complementarity problem to differentiable unconstrained minimization
• On the Resolution of the Generalized Nonlinear Complementarity Problem
• A Trust Region Method for Solving Generalized Complementarity Problems
• Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.