An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1007/s10957-015-0757-1 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10957-015-0757-1 / rank
 
Normal rank

Latest revision as of 12:34, 9 December 2024

scientific article
Language Label Description Also known as
English
An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
scientific article

    Statements

    An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2016
    0 references
    convex optimization
    0 references
    dual decomposition
    0 references
    inexact gradient method
    0 references
    suboptimality and constraint violations
    0 references
    0 references

    Identifiers