A new primal-dual polynomial algorithm for convex quadratic programming (Q2858217)
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 6229480
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new primal-dual polynomial algorithm for convex quadratic programming |
scientific article; zbMATH DE number 6229480 |
Statements
19 November 2013
0 references
convex quadratic programming
0 references
interior-point algorithm
0 references
path-following method
0 references
polynomial-time complexity
0 references
A new primal-dual polynomial algorithm for convex quadratic programming (English)
0 references
0.938897669315338
0 references
0.8563665151596069
0 references
0.8490899205207825
0 references
0.8441007137298584
0 references
0.8434910178184509
0 references
