A projection-type method for the generalized linear complementarity problem over a polyhedral cone

zbMATH Open1140.65050MaRDI QIDQ5437398FDOQ5437398

Authors: Hongchun Sun, Houchun Zhou, Qingjun Ren 

Publication date: 18 January 2008

Recommendations

• A Newton-type algorithm for generalized linear complementarity problem over a polyhedral cone
• A global \(\mathbb{R}\)-linear convergence algorithm for the generalized linear complementarity problem over a closed convex cone
• A potential reduction algorithm for generalized linear complementarity problem over a polyhedral cone
• Publication:4865357
• Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone

zbMATH Keywords

numerical examplespredictor-corrector method

Mathematics Subject Classification ID

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

Cited In (6)

• A potential reduction algorithm for generalized linear complementarity problem over a polyhedral cone
• Generalized polynomial complementarity problems over a polyhedral cone
• A linear combinatorial projection method for a class of generalized implicit complementarity problems
• A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
• Generalized tensor complementarity problems over a polyhedral cone
• Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions

This page was built for publication: A projection-type method for the generalized linear complementarity problem over a polyhedral cone

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