A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity (Q3083311)
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 class of large neighborhood path-following interior point algorithms for semidefinite optimization with O(nTr(X^0S^0)) iteration complexity |
scientific article; zbMATH DE number 5868719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity |
scientific article; zbMATH DE number 5868719 |
Statements
A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity (English)
0 references
21 March 2011
0 references
interior point methods
0 references
large neighborhood
0 references
path-following algorithm
0 references
semidefinite optimization
0 references
0.9066031575202942
0 references
0.8803089261054993
0 references
0.8788673281669617
0 references
0.8773006796836853
0 references
0.8603463768959045
0 references
