Polynomial complexity of primal-dual interior-point methods for convex quadratic programming with self-regular proximity (Q3572887)
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: Polynomial complexity of primal-dual interior-point methods for convex quadratic programming with self-regular proximity |
scientific article; zbMATH DE number 5732849
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial complexity of primal-dual interior-point methods for convex quadratic programming with self-regular proximity |
scientific article; zbMATH DE number 5732849 |
Statements
8 July 2010
0 references
convex quadratic programming
0 references
interior-point method
0 references
primal-dual
0 references
large-update
0 references
polynomial complexity
0 references
0.854888379573822
0 references
0.8441007137298584
0 references
0.8382658958435059
0 references
0.8313164710998535
0 references
0.8193991184234619
0 references
