Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming (Q4702299)
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 1368629
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming |
scientific article; zbMATH DE number 1368629 |
Statements
Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming (English)
0 references
24 November 1999
0 references
semidefinite programming
0 references
interior-point methods
0 references
polynomial complexity
0 references
path-following methods
0 references
primal-dual methods
0 references
Newton's method
0 references
0.9167910218238832
0 references
0.8885053992271423
0 references
