A polynomial time constraint-reduced algorithm for semidefinite optimization problems (Q493064)
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 polynomial time constraint-reduced algorithm for semidefinite optimization problems |
scientific article; zbMATH DE number 6480824
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time constraint-reduced algorithm for semidefinite optimization problems |
scientific article; zbMATH DE number 6480824 |
Statements
A polynomial time constraint-reduced algorithm for semidefinite optimization problems (English)
0 references
11 September 2015
0 references
semidefinite programming
0 references
interior point methods
0 references
constraint reduction
0 references
primal dual infeasible
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8682250380516052
0 references
0.8063954710960388
0 references
0.8028567433357239
0 references
0.8013794422149658
0 references
0.7993432283401489
0 references
