How well do local algorithms solve semidefinite programs? (Q4978006)
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: How well do local algorithms solve semidefinite programs? |
scientific article; zbMATH DE number 6761841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How well do local algorithms solve semidefinite programs? |
scientific article; zbMATH DE number 6761841 |
Statements
How well do local algorithms solve semidefinite programs? (English)
0 references
17 August 2017
0 references
local algorithm
0 references
community detection
0 references
non-backtracking spectrum
0 references
semidefinite program relaxation
0 references
0.8195401430130005
0 references
0.7858380675315857
0 references
0.7750024795532227
0 references
0.7537045478820801
0 references
