A primal-dual interior-point algorithm with arc-search for semidefinite programming (Q2311204)
From MaRDI portal
!
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 7078376
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A primal-dual interior-point algorithm with arc-search for semidefinite programming |
scientific article; zbMATH DE number 7078376 |
Statements
A primal-dual interior-point algorithm with arc-search for semidefinite programming (English)
0 references
10 July 2019
0 references
semidefinite programming
0 references
arc-search
0 references
interior-point algorithm
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8922948241233826
0 references
0.8817310333251953
0 references
0.8791761994361877
0 references
0.8725103139877319
0 references
