Bounding duality gap for separable problems with linear constraints (Q288396)
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: Bounding duality gap for separable problems with linear constraints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding duality gap for separable problems with linear constraints |
scientific article |
Statements
Bounding duality gap for separable problems with linear constraints (English)
0 references
25 May 2016
0 references
duality gap
0 references
Shapley-Folkman theorem
0 references
separable problems
0 references
convex relaxation
0 references
randomized algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7466835379600525
0 references
0.7400122880935669
0 references
0.7361491918563843
0 references
0.7313756942749023
0 references
