On solvability of the complex linear complementarity problem

MaRDI QIDQ761979zbMATH OpenFDO

Authors J. Parida, Bertram Mond

Publication date 1984

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complex linear complementarity problemexistence of a solutionperturbation techniquepointed polyhedral conesolvability conditions

Mathematics Subject Classification ID

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

Review text

Using a perturbation technique, conditions are given for solvability of the complex linear complementarity problem \(z\in S\), \(Mz+q\in S^*\), \(Re<z,Mz+q>=0\) where S is a pointed polyhedral cone in \({\mathbb{C}}^ n\) and \(S^*\) the polar cone of S. Results obtained include, for example, proofs of the existence of a solution when M is positive definite, S- copositive or regular. If feasibility is also assumed, then some of these conditions on M are weakened.

Recommendations

• scientific article; zbMATH DE number 4104741
• Two counterexamples on the polynomial solvability of the linear complementarity problem
• Some aspects of feasibility and solvability for cone linear complementarity problems
• Existence theory for the complex linear complementarity problem
• The complementarity problem

Cited in

(6)

• Extension to necessary optimality conditions in complex programming
• Existence theory for the complex linear complementarity problem
• Some aspects of feasibility and solvability for cone linear complementarity problems
• scientific article; zbMATH DE number 4104741 (Why is no real title available?)
• Modulus-based matrix splitting methods for complex linear complementarity problem
• CP-rays in simplicial cones

This page was built for publication: On solvability of the complex linear complementarity problem

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