SOLVING STRONGLY MONOTONE LINEAR COMPLEMENTARITY PROBLEMS

DOI10.1142/S0219198913400355zbMath1282.90191MaRDI QIDQ5396054

Vetrivel, V., Chandrashekaran Arumugasamy

Publication date: 5 February 2014

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

zbMATH Keywords

complementarity problemsstrongly monotoneLipschitzian property

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)

Related Items (2)

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

Cites Work

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

This page was built for publication: SOLVING STRONGLY MONOTONE LINEAR COMPLEMENTARITY PROBLEMS