سند علمی

A New Perspective of Proximal Gradient Algorithms

چکیده

We provide a new perspective to understand proximal gradient algorithms. We show that both proximal gradient algorithm (PGA) and Bregman proximal gradient algorithm (BPGA) can be viewed as generalized proximal point algorithm (GPPA), based on which more accurate convergence rates of PGA and BPGA are obtained directly. Furthermore, based on GPPA framework, we incorporate the back-tracking line search scheme into PGA and BPGA, and analyze the convergence rate with numerical verification.

اسناد مشابه

  • The proximal-proximal gradient algorithm

    سند علمی۲۰۱۳Ting Kei Pong

    We consider the problem of minimizing a convex objective which is the sum of a smooth part, with Lipschitz continuous gradient, and a nonsmooth part. Inspired by various applications, we focus on the case when the nonsmooth part is a composition of a proper closed convex function

  • On Stochastic Proximal Gradient Algorithms

    سند علمی۲۰۱۴YVES F. ATCHADÉ, ERIC MOULINES

    We study a perturbed version of the proximal gradient algorithm for which the gradient is not known in closed form and should be approximated. We address the convergence and derive a non-asymptotic bound on the convergence rate for the perturbed proximal gradient, a perturbed ave

  • Efficient Inexact Proximal Gradient Algorithm for Nonconvex Problems

    سند علمی۲۰۱۷IJCAIQuanming Yao, James T. Kwok, Fei Gao, Wei Chen

    The proximal gradient algorithm has been popularly used for convex optimization. Recently, it has also been extended for nonconvex problems, and the current state-of-the-art is the nonmonotone accelerated proximal gradient algorithm. However, it typically requires two exact proxi

  • Stochastic Proximal Gradient Algorithms for Multi-Source Quantitative Photoacoustic Tomography

    سند علمی۲۰۱۸EntropySimon Rabanser, Lukas Neumann, Markus Haltmeier

    The development of accurate and efficient image reconstruction algorithms is a central aspect of quantitative photoacoustic tomography (QPAT). In this paper, we address this issues for multi-source QPAT using the radiative transfer equation (RTE) as accurate model for light trans

  • Snake: a Stochastic Proximal Gradient Algorithm for Regularized Problems over Large Graphs

    سند علمی۲۰۱۷CoRRAdil Salim, Pascal Bianchi, Walid Hachem

    A regularized optimization problem over a large unstructured graph is studied, where the regularization term is tied to the graph geometry. Typical regularization examples include the total variation and the Laplacian regularizations over the graph. When applying the proximal gra

  • Stochastic Proximal Gradient Algorithms for Penalized Mixed Models

    سند علمی۲۰۱۷Gersende Fort, Edouard Ollier, Adeline Samson

    Motivated by penalized likelihood maximization in complex models, we study optimization problems where neither the function to optimize nor its gradient have an explicit expression, but its gradient can be approximated by a Monte Carlo technique. We propose a new algorithm based