A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP (Q3076648)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5856580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP |
scientific article; zbMATH DE number 5856580 |
Statements
23 February 2011
0 references
semidefinite programming
0 references
semidefinite least squares
0 references
infeasible central path, infeasible interior point method
0 references
inexact search direction
0 references
polynomial complexity
0 references
0.8728405833244324
0 references
0.8704827427864075
0 references
0.8598619699478149
0 references
0.8509320616722107
0 references
0.8500359654426575
0 references
