A proximal fully parallel splitting method with a relaxation factor for separable convex programming (Q6086848): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.apnum.2023.09.003 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.APNUM.2023.09.003 / rank
 
Normal rank

Latest revision as of 19:18, 30 December 2024

scientific article; zbMATH DE number 7763846
Language Label Description Also known as
English
A proximal fully parallel splitting method with a relaxation factor for separable convex programming
scientific article; zbMATH DE number 7763846

    Statements

    A proximal fully parallel splitting method with a relaxation factor for separable convex programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2023
    0 references
    augmented Lagrangian method
    0 references
    splitting algorithm
    0 references
    relaxation factor
    0 references
    step size
    0 references
    convergence rate
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers