Asset Details
Do you wish to reserve the book?
On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers
Do you wish to request the book?
On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
On the Global and Linear Convergence of the Generalized Alternating Direction Method of Multipliers
2016
Overview
The formulation
min
x
,
y
f
(
x
)
+
g
(
y
)
,
subject
to
A
x
+
B
y
=
b
,
where
f
and
g
are extended-value convex functions, arises in many application areas such as signal processing, imaging and image processing, statistics, and machine learning either naturally or after variable splitting. In many common problems, one of the two objective functions is strictly convex and has Lipschitz continuous gradient. On this kind of problem, a very effective approach is the alternating direction method of multipliers (ADM or ADMM), which solves a sequence of
f
/
g
-decoupled subproblems. However, its effectiveness has not been matched by a provably fast rate of convergence; only sublinear rates such as
O
(1 /
k
) and
O
(
1
/
k
2
)
were recently established in the literature, though the
O
(1 /
k
) rates do not require strong convexity. This paper shows that global linear convergence can be guaranteed under the assumptions of strong convexity and Lipschitz gradient on one of the two functions, along with certain rank assumptions on
A
and
B
. The result applies to various generalizations of ADM that allow the subproblems to be solved faster and less exactly in certain manners. The derived rate of convergence also provides some theoretical guidance for optimizing the ADM parameters. In addition, this paper makes meaningful extensions to the existing global convergence theory of ADM generalizations.
Publisher
Springer US,Springer Nature B.V
