Identifying the optimal partition in convex quadratic programming (Q924889)
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 5280658
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identifying the optimal partition in convex quadratic programming |
scientific article; zbMATH DE number 5280658 |
Statements
Identifying the optimal partition in convex quadratic programming (English)
0 references
29 May 2008
0 references
linear programming
0 references
linear complementarity
0 references
strict complementarity
0 references
maximally complementary solutions
0 references
0 references
0.7686647176742554
0 references
0.7647382616996765
0 references
0.758534848690033
0 references
