Asset Details
Do you wish to reserve the book?
On the complexity analysis of randomized block-coordinate descent methods
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 complexity analysis of randomized block-coordinate descent methods
Do you wish to request the book?
On the complexity analysis of randomized block-coordinate descent methods
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 complexity analysis of randomized block-coordinate descent methods
2015
Overview
In this paper we analyze the randomized block-coordinate descent (RBCD) methods proposed in Nesterov (SIAM J Optim 22(2):341–362,
2012
), Richtárik and Takáč (Math Program 144(1–2):1–38,
2014
) for minimizing the sum of a smooth convex function and a block-separable convex function, and derive improved bounds on their convergence rates. In particular, we extend Nesterov’s technique developed in Nesterov (SIAM J Optim 22(2):341–362,
2012
) for analyzing the RBCD method for minimizing a smooth convex function over a block-separable closed convex set to the aforementioned more general problem and obtain a sharper expected-value type of convergence rate than the one implied in Richtárik and Takáč (Math Program 144(1–2):1–38,
2014
). As a result, we also obtain a better high-probability type of iteration complexity. In addition, for unconstrained smooth convex minimization, we develop a new technique called
randomized estimate sequence
to analyze the accelerated RBCD method proposed by Nesterov (SIAM J Optim 22(2):341–362,
2012
) and establish a sharper expected-value type of convergence rate than the one given in Nesterov (SIAM J Optim 22(2):341–362,
2012
).
Publisher
Springer Berlin Heidelberg,Springer Nature B.V
