Solving strongly monotone linear complementarity problems

DOI10.1142/S0219198913400355MaRDI QIDQ5396054zbMATH OpenFDO

Authors V. Vetrivel, Chandrashekaran Arumugasamy, T. Parthasarathy

Publication date 5 February 2014

Published in International Game Theory Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219198913400355

zbMATH Keywords

complementarity problemsLipschitzian propertystrongly monotone

Mathematics Subject Classification ID

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

Recommendations

• On the Lipschitz Continuity of the Solution Map in Semidefinite Linear Complementarity Problems
• On the Lipschitzian property in linear complementarity problems over symmetric cones
• scientific article; zbMATH DE number 797059
• The semidefinite linear complementarity problem
• A finite improvement algorithm for the linear complementarity problem

Cites work

• A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
• An existence theorem for the complementarity problem
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• scientific article; zbMATH DE number 715155 (Why is no real title available?)
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Nonlinear Programming
• On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems.
• Some P-properties for linear transformations on Euclidean Jordan algebras

Cited in

(6)

• Strict monotonicity in Todd's low-complexity algorithm for linear programming
• Monotonizing linear programs with up to two nonzeroes per column
• Preface: International conference on game theory and optimization, June 6--10, 2016, Indian Institute of Technology Madras, Chennai, India
• T. Parthasarathy's contributions to complementarity problems: a survey
• On the Lipschitzian property in linear complementarity problems over symmetric cones
• Une procédure de purification pour les problèmes de complémentarité linéaire, monotones

This page was built for publication: Solving strongly monotone linear complementarity problems

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