On the O(1/t) convergence rate of alternating direction method
Bingsheng He (hebmanju.edu.cn)
Abstract: The old alternating direction method (ADM) has found many new applications recently, and its empirical efficiency has been well illustrated in various fields. However, the estimate of ADM's convergence rate remains a theoretical challenge for a few decades. In this note, we provide a uniform proof to show the O(1/t) convergence rate for both the original ADM and its linearized variant (known as the split inexact Uzawa method in image processing literature). The proof is based on a variational inequality approach which is novel in the literature, and it is very simple.
Keywords: Alternating direction method, convergence rate, split inexact Uzawa method, variational inequalities, convex programming.
Category 1: Convex and Nonsmooth Optimization (Convex Optimization )
Entry Submitted: 09/10/2011
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|