A linear combinatorial projection method for a class of generalized implicit complementarity problems

MaRDI QIDQ2924318zbMATH OpenFDO

Authors Banggui Zheng, Xiaowei Deng, Gang Wang

Publication date 3 November 2014

Published in Journal of Systems Science and Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

generalized implicit complementarity problemcombinatorial projection methodlinearly convergencestep size correction

Mathematics Subject Classification ID

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

Recommendations

• An implicit enumeration procedure for the general linear complementarity problem
• A linearization method for generalized complementarity problems
• Publication:4865357
• A projection-type method for the generalized linear complementarity problem over a polyhedral cone
• scientific article; zbMATH DE number 1131717
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• On the solution and complexity of a generalized linear complementarity problem
• Projection and contraction methods for nonlinear complementarity problem
• The generalized linear complementarity problem revisited
• A generalized gradient projection algorithm for a mathematical program with complementarity constraints

Cited in

(1)

• The extragradient algorithm for a form of generalized implicit complementarity problem

This page was built for publication: A linear combinatorial projection method for a class of generalized implicit complementarity problems

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