Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0674.90092
Cottle, R.W.; Pang, J.-S.; Venkateswaran, V.
Sufficient matrices and the linear complementarity problem. (English)
[J] Linear Algebra Appl. 114-115, 231-249 (1989). ISSN 0024-3795

A new class of matrices, related to the linear complementarity problem (LCP), the so called ``row sufficient'' matrices, are introduced. Respectively, the transpose of such a matrix is called ``column sufficient''. Two important results are proved: (i) A matrix $M$ is row sufficient iff for every $q\in \Bbb R^n$ any Kuhn-Tucker-point of the associated quadratic program solves the LCP $(q,M)$; (ii) $M$ is column sufficient iff for every $q\in \Bbb R^n$ the LCP $(q,M)$ has a convex solution set. \par The connections with other well-known matrix classes in linear complementarity theory are also discussed.
[E.Iwanow]

MSC 2000:: *90C33 Complementarity problems
15A57 Other types of matrices

Keywords: row sufficient matrices; linear complementarity problem; column sufficient

Cited in: Zbl 1170.90497 Zbl 1141.15022 Zbl 1106.70304 Zbl 1056.90133 Zbl 0993.15023 Zbl 1035.90092 Zbl 0977.90065 Zbl 0947.90118 Zbl 0922.90136 Zbl 0851.15015 Zbl 0778.65044 Zbl 0773.90077 Zbl 0756.90087

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]