Sublinear time algorithms for approximate semidefinite programming (Q304246)
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: Sublinear time algorithms for approximate semidefinite programming |
scientific article; zbMATH DE number 6619167
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear time algorithms for approximate semidefinite programming |
scientific article; zbMATH DE number 6619167 |
Statements
Sublinear time algorithms for approximate semidefinite programming (English)
0 references
25 August 2016
0 references
semidefinite programming
0 references
sublinear algorithms
0 references
online algorithms
0 references
large scale optimization
0 references
0 references
0 references
0 references
0.7911303639411926
0 references
0.7770548462867737
0 references
0.7749408483505249
0 references
0.7694721221923828
0 references
