Reduction of monotone linear complementarity problems over cones to linear programs over cones

MaRDI QIDQ1384429zbMATH OpenFDO

Authors M. Shida, Susumu Shindoh, Masakazu Kojima

Publication date 13 April 1998

Published in Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

monotone semidefinite linear complementarity problem

Mathematics Subject Classification ID

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

Recommendations

• On reduced convex QP formulations of monotone LCPs
• Reducing a monotone horizontal LCP to an LCP
• Generalized Linear Complementarity Problems
• Reducing horizontal linear complementarity problems
• Some geometrical aspects of semidefinite linear complementarity problems

Cited in

(6)

• Semidefinite programming
• A polynomial-time interior-point algorithm for convex quadratic semidefinite optimization
• A potential reduction method for the generalized linear complementarity problem over a polyhedral cone
• Reducing a monotone horizontal LCP to an LCP
• On reduced convex QP formulations of monotone LCPs
• Complementarity problems over symmetric cones: A survey of recent developments in several aspects

This page was built for publication: Reduction of monotone linear complementarity problems over cones to linear programs over cones

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