New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction (Q5949888): Difference between revisions
From MaRDI portal
Latest revision as of 21:34, 3 June 2024
scientific article; zbMATH DE number 1678809
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction |
scientific article; zbMATH DE number 1678809 |
Statements
New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction (English)
0 references
5 December 2001
0 references
The authors study the computational complexity of interior point method based on Nesterov-odd direction for semidefinite optimization [see \textit{Y. Nesterov} and \textit{M. Todd}, SIAM J. Optim. 8, 324-364 (1998; Zbl 0922.90110)]. They present a unified complexity analysis for both large updates and small updates.
0 references
semidefinite optimization
0 references
primal-dual interior point methods
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
