Almost definiteness of matrices on polyhedral cones (Q1183149)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 32814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost definiteness of matrices on polyhedral cones |
scientific article; zbMATH DE number 32814 |
Statements
Almost definiteness of matrices on polyhedral cones (English)
0 references
28 June 1992
0 references
After some preliminaries in \(\S2\) containing some basic definitions of almost definite matrices, the author develops the basic theory for almost definite matrices in \(\S3\). In \(\S4\), he establishes a connection between conditional definiteness and quadratic programming. In \(\S\S5-6\) he proposes criteria for almost definite matrices, using principal pivoting and quadratic programming as the basic mathematical tools. In \(\S5\) he discusses the case of the so-called nonnegative polyhedral cone, whereas in \(\S6\) he deals with the case of the general polyhedral cone. He also determines breaking rays of these kinds of matrices, i.e., rays on which the conditional definiteness class in question is violated.
0 references
quadratic forms
0 references
almost definite matrices
0 references
conditional definiteness
0 references
quadratic programming
0 references
principal pivoting
0 references
nonnegative polyhedral cone
0 references
0.93714994
0 references
0.9193629
0 references
0.9131158
0 references
0 references
0.90164393
0 references
0 references
0.8952008
0 references
0.88848615
0 references
0.8864367
0 references
