A note on the strong polynomiality of convex quadratic programming (Q1804355)
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: A note on the strong polynomiality of convex quadratic programming |
scientific article; zbMATH DE number 754863
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the strong polynomiality of convex quadratic programming |
scientific article; zbMATH DE number 754863 |
Statements
A note on the strong polynomiality of convex quadratic programming (English)
0 references
1 April 1996
0 references
convex quadratic program
0 references
nearest point on a simplicial cone
0 references
strongly polynomial time
0 references
0 references
0.9313258
0 references
0.9204607
0 references
0.9066042
0 references
0.89878166
0 references
0.89823055
0 references
