AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM (Q3202145)
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 O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM |
scientific article; zbMATH DE number 4179154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM |
scientific article; zbMATH DE number 4179154 |
Statements
AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM (English)
0 references
1990
0 references
positive semi-definite matrix
0 references
interior path following algorithm
0 references
polynomially bounded algorithm
0 references
linear complementarity
0 references
interior point method
0 references
0.8923847079277039
0 references
0.8668156862258911
0 references
0.8649768233299255
0 references
0.8558724522590637
0 references
0.8490859270095825
0 references
