Bounding duality gap for separable problems with linear constraints (Q288396)

From MaRDI portal
scientific article
Language Label Description Also known as
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
    0 references
    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 references
    0 references
    0 references

    Identifiers