Relaxation methods for problems with strictly convex separable costs and linear constraints (Q3777809)

From MaRDI portal
Revision as of 15:55, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Relaxation methods for problems with strictly convex separable costs and linear constraints
scientific article

    Statements

    Relaxation methods for problems with strictly convex separable costs and linear constraints (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    Fenchel duality
    0 references
    strictly convex, possibly nondifferentiable, separable cost
    0 references
    linear constraints
    0 references
    unconstrained minimization
    0 references
    parallel methods
    0 references
    Gauss-Seidel relaxation
    0 references