An algorithmic characterization of \(\mathbf P\)-matricity (Q2866216)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithmic characterization of \(\mathbf P\)-matricity |
scientific article; zbMATH DE number 6238068
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic characterization of \(\mathbf P\)-matricity |
scientific article; zbMATH DE number 6238068 |
Statements
13 December 2013
0 references
linear complementarity problem
0 references
semismooth Newton method
0 references
Newton-min algorithm
0 references
\(\mathbf {NM}\)-matrix
0 references
\(\mathbf P\)-matricity characterization
0 references
\(\mathbf P\)-matrix
0 references
An algorithmic characterization of \(\mathbf P\)-matricity (English)
0 references
A real matrix is a \(\mathbf P\)-matrix if its principal minors are positive. This paper gives a characterization of \(\mathbf P\)-matricity. The authors show that a matrix belongs to the class of \(\mathbf P\)-matrices if and only if the semismooth Newton algorithm does not cycle between two distinct points when it is used to solve the corresponding linear complementary problem.
0 references
