On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization (Q3562415)
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: On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization |
scientific article |
Statements
On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization (English)
0 references
21 May 2010
0 references
semidefinite optimization
0 references
predictor-corrector algorithms
0 references
Mehrotra-type algorithm
0 references
polynomial complexity
0 references
