On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Marc Teboulle / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 49M27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6582792 / rank
 
Normal rank
Property / zbMATH Keywords
 
non-smooth convex minimization
Property / zbMATH Keywords: non-smooth convex minimization / rank
 
Normal rank
Property / zbMATH Keywords
 
alternating proximal methods
Property / zbMATH Keywords: alternating proximal methods / rank
 
Normal rank
Property / zbMATH Keywords
 
coordinate descent
Property / zbMATH Keywords: coordinate descent / rank
 
Normal rank
Property / zbMATH Keywords
 
non-asymptotic rate of convergence
Property / zbMATH Keywords: non-asymptotic rate of convergence / rank
 
Normal rank

Revision as of 18:38, 27 June 2023

scientific article
Language Label Description Also known as
English
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
scientific article

    Statements

    On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (English)
    0 references
    0 references
    0 references
    0 references
    19 May 2016
    0 references
    non-smooth convex minimization
    0 references
    alternating proximal methods
    0 references
    coordinate descent
    0 references
    non-asymptotic rate of convergence
    0 references

    Identifiers