Superlinear convergence of interior-point algorithms for semidefinite programming (Q1273164)
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: Superlinear convergence of interior-point algorithms for semidefinite programming |
scientific article; zbMATH DE number 1229636
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Superlinear convergence of interior-point algorithms for semidefinite programming |
scientific article; zbMATH DE number 1229636 |
Statements
Superlinear convergence of interior-point algorithms for semidefinite programming (English)
0 references
5 May 1999
0 references
polynomiality
0 references
superlinear convergence
0 references
primal-dual infeasible interior-point path-following algorithm
0 references
semidefinite programming
0 references
central path
0 references
0 references
0 references
0 references
0 references
0.9658945
0 references
0 references
0.9608895
0 references
0.9607148
0 references
0.9568355
0 references
0.9548248
0 references
0.9481814
0 references
0.9445747
0 references
0.94232064
0 references
