Computational complexity of Inexact Proximal Point Algorithm for Convex Optimization under Holderian Growth

by   Andrei Patrascu, et al.

Several decades ago the Proximal Point Algorithm (PPA) stated to gain a long-lasting attraction for both abstract operator theory and numerical optimization communities. Even in modern applications, researchers still use proximal minimization theory to design scalable algorithms that overcome nonsmoothness. Remarkable works as <cit.> established tight relations between the convergence behaviour of PPA and the regularity of the objective function. In this manuscript we derive nonasymptotic iteration complexity of exact and inexact PPA to minimize convex functions under γ-Holderian growth: log(1/ϵ) (for γ∈ [1,2]) and 1/ϵ^γ - 2 (for γ > 2). In particular, we recover well-known results on PPA: finite convergence for sharp minima and linear convergence for quadratic growth, even under presence of inexactness. However, without taking into account the concrete computational effort paid for computing each PPA iteration, any iteration complexity remains abstract and purely informative. Therefore, using an inner (proximal) gradient/subgradient method subroutine that computes inexact PPA iteration, we secondly show novel computational complexity bounds on a restarted inexact PPA, available when no information on the growth of the objective function is known. In the numerical experiments we confirm the practical performance and implementability of our framework.


page 1

page 2

page 3

page 4


On the complexity of convex inertial proximal algorithms

The inertial proximal gradient algorithm is efficient for the composite ...

Fast Proximal Gradient Methods for Nonsmooth Convex Optimization for Tomographic Image Reconstruction

The Fast Proximal Gradient Method (FPGM) and the Monotone FPGM (MFPGM) f...

Deep Q-Network with Proximal Iteration

We employ Proximal Iteration for value-function optimization in reinforc...

Sharper Bounds for Proximal Gradient Algorithms with Errors

We analyse the convergence of the proximal gradient algorithm for convex...

Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction

The contribution of this paper includes two aspects. First, we study the...

A family of multi-parameterized proximal point algorithms

In this paper, a multi-parameterized proximal point algorithm combining ...

Efficient implementation of incremental proximal-point methods

Model training algorithms which observe a small portion of the training ...

Code Repositories


Restarted Inexact Proximal Point Algorithm

view repo