A Family of Multi-Parameterized Proximal Point Algorithms

A Family of Multi-Parameterized Proximal Point Algorithms

In this paper, a multi-parameterized proximal point algorithm combining with a relaxation step is developed for solving convex minimization problem subject to linear constraints. We show its global convergence and sublinear convergence rate from the prospective of variational inequality. Preliminary...

Full description

Bibliographic Details
Main Authors: Jianchao Bai, Ke Guo, Xiaokai Chang
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Convex optimization
proximal point algorithm
complexity
signal processing
Online Access:https://ieeexplore.ieee.org/document/8894083/

Internet

https://ieeexplore.ieee.org/document/8894083/

Similar Items