Feasible and accurate algorithms for covering semidefinite programs (Q3569887)
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: Feasible and accurate algorithms for covering semidefinite programs |
scientific article; zbMATH DE number 5724316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Feasible and accurate algorithms for covering semidefinite programs |
scientific article; zbMATH DE number 5724316 |
Statements
Feasible and Accurate Algorithms for Covering Semidefinite Programs (English)
0 references
22 June 2010
0 references
0.8466328382492065
0 references
0.8366387486457825
0 references
0.8278177380561829
0 references
0.8161635994911194
0 references
0.8040361404418945
0 references
