A fast dual proximal gradient algorithm for convex minimization and applications

We consider the convex composite problem of minimizing the sum of a strongly convex function and a general extended valued convex function. We present a dual-based proximal gradient scheme for solving this problem. We show that although the rate of convergence of the dual objective function sequence...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operations research letters Ročník 42; číslo 1; s. 1 - 6
Hlavní autoři: Beck, Amir, Teboulle, Marc
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.01.2014
Témata:
Algorithms
Convergence
Convex optimization
Dual-based methods
Fast gradient methods
Minimization
Operations research
Optimization
Rate of convergence
Sequences
Fast gradient methods
Dual-based methods
Rate of convergence
Convex optimization
ISSN:0167-6377, 1872-7468
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We consider the convex composite problem of minimizing the sum of a strongly convex function and a general extended valued convex function. We present a dual-based proximal gradient scheme for solving this problem. We show that although the rate of convergence of the dual objective function sequence converges to the optimal value with the rate O(1/k2), the rate of convergence of the primal sequence is of the order O(1/k).
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2013.10.007