A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (Q1644574)
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 6892912
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization |
scientific article; zbMATH DE number 6892912 |
Statements
A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (English)
0 references
21 June 2018
0 references
convex quadratic semidefinite optimization
0 references
interior point methods
0 references
short-step primal-dual algorithms
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0.8676294684410095
0 references
0.8673151135444641
0 references
0.8660715818405151
0 references
0.8592548966407776
0 references
