A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming (Q2630833)
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: A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming |
scientific article; zbMATH DE number 6605661
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming |
scientific article; zbMATH DE number 6605661 |
Statements
A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming (English)
0 references
22 July 2016
0 references
infeasible-interior-point algorithm
0 references
wide neighborhood
0 references
symmetric cone programming
0 references
Euclidean Jordan algebra
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9708171
0 references
0.96172386
0 references
0.93977314
0 references
0.9381047
0 references
0.9309491
0 references
0.92756164
0 references
0.92554134
0 references
