A parameterized proximal point algorithm for separable convex optimization

  title={A parameterized proximal point algorithm for separable convex optimization},
  author={J. Bai and Hongchao Zhang and Jicheng Li},
  journal={Optimization Letters},
In this paper, we develop a parameterized proximal point algorithm (P-PPA) for solving a class of separable convex programming problems subject to linear and convex constraints. The proposed algorithm is provable to be globally convergent with a worst-case O(1 / t) convergence rate, where t denotes the iteration number. By properly choosing the algorithm parameters, numerical experiments on solving a sparse optimization problem arising from statistical learning show that our P-PPA could perform… Expand
A Family of Multi-Parameterized Proximal Point Algorithms
General parameterized proximal point algorithm with applications in statistical learning
Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers
On several variants of the primal-dual hybrid gradient algorithm ∗
Convergence of the augmented decomposition algorithm
Accelerated Symmetric ADMM and Its Applications in Signal Processing


Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
A customized proximal point algorithm for convex minimization with linear constraints
A class of customized proximal point algorithms for linearly constrained convex optimization
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
A proximal partially parallel splitting method for separable convex programs
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
Inexact alternating direction multiplier methods for separable convex optimization