New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming (Q2867429)
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: New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming |
scientific article; zbMATH DE number 6240559
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New complexity analysis of a Mehrotra-type predictor-corrector algorithm for semidefinite programming |
scientific article; zbMATH DE number 6240559 |
Statements
New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming (English)
0 references
19 December 2013
0 references
semidefinite programming
0 references
interior-point methods
0 references
predictor-corrector algorithm
0 references
Mehrotra-type algorithm
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8914515972137451
0 references
0.8869054913520813
0 references
0.8748330473899841
0 references
0.8685650825500488
0 references
