Relaxation methods for problems with strictly convex separable costs and linear constraints (Q3777809): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Paul Tseng / rank
Normal rank
 
Property / author
 
Property / author: Paul Tseng / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation Methods for Network Flow Problems with Convex Arc Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation Methods for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of a block successive over-relaxation method for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On search directions for minimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of sequential minimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Note on the Cyclic Coordinate Ascent Method / rank
 
Normal rank

Latest revision as of 14:55, 18 June 2024

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
    1987
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references