arXiv Analytics

Sign in

arXiv:1503.05601 [math.OC]AbstractReferencesReviewsResources

A New Perspective of Proximal Gradient Algorithms

Yi Zhou, Yingbin Liang, Lixin Shen

Published 2015-03-18Version 1

We take a di?erent approach to analyze the generalized proximal point algorithm (GPPA). Our analysis justi?es the structure imposed on the distance metric in establishing the convergence rate of GPPA.We then show that both proximal gradient algorithm (PGA) and Bregman proximal gradient algorithm (BPGA) can be viewed as GPPA, based on which the convergence rates of PGA and BPGA are obtained directly. Furthermore, the convergence rate obtained in this way is more accurate than the existing rate.

Related articles: Most relevant | Search more
arXiv:1904.11295 [math.OC] (Published 2019-04-25)
Bregman Proximal Gradient Algorithm with Extrapolation for a class of Nonconvex Nonsmooth Minimization Problems
arXiv:0904.4229 [math.OC] (Published 2009-04-27)
Convergence Rate of Stochastic Gradient Search in the Case of Multiple and Non-Isolated Minima
arXiv:1204.0301 [math.OC] (Published 2012-04-02)
Tree Codes Improve Convergence Rate of Consensus Over Erasure Channels