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 this page instead for the normal view: A new primal-dual polynomial algorithm for convex quadratic programming |
scientific article; zbMATH DE number 6229480
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
