Basis- and partition identification for quadratic programming and linear complementarity problems (Q1961979)
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: Basis- and partition identification for quadratic programming and linear complementarity problems |
scientific article; zbMATH DE number 1394868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Basis- and partition identification for quadratic programming and linear complementarity problems |
scientific article; zbMATH DE number 1394868 |
Statements
Basis- and partition identification for quadratic programming and linear complementarity problems (English)
0 references
30 January 2000
0 references
basis recovery
0 references
partition
0 references
principal pivot transforms
0 references
Balinski-Tucker tableaux
0 references
quadratic programming
0 references
linear complementarity problems
0 references
interior point methods
0 references
Criss-Cross method
0 references
crossover
0 references
sufficient matrices
0 references
0.89692837
0 references
0.89117783
0 references
0.8813578
0 references
0.87873024
0 references
0.8718034
0 references
0 references
