On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence (Q1582351)
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 a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence |
scientific article; zbMATH DE number 1513210
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence |
scientific article; zbMATH DE number 1513210 |
Statements
On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence (English)
0 references
14 January 2001
0 references
predictor-corrector algorithms
0 references
semidefinite programming
0 references
globally convergent
0 references
superlinear convergence
0 references
infeasible-interior-point algorithm
0 references
