Convergence Analysis of the Relaxed Proximal Point Algorithm
Recently, a worst-case convergence rate was established for the Douglas-Rachford alternating direction method of multipliers (ADMM) in an ergodic sense. The relaxed proximal point algorithm (PPA) is a generalization of the original PPA which includes the Douglas-Rachford ADMM as a special case. In...
Saved in:
| Main Authors: | Min Li, Yanfei You |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2013/912846 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Relatively Inexact Proximal Point Algorithm and Linear Convergence Analysis
by: Ram U. Verma
Published: (2009-01-01) -
A Modified Proximal Point Algorithm and Some Convergence Results
by: Shengquan Weng, et al.
Published: (2021-01-01) -
Bregman Distance and Strong Convergence of Proximal-Type Algorithms
by: Li-Wei Kuo, et al.
Published: (2013-01-01) -
FINITE CONVERGENCE OF THE PROXIMAL POINT METHOD FOR SOLVING EQUILIBRIUM PROBLEMS ON HADAMARD MANIFOLDS
by: Nguyen Thi Thu
Published: (2025-03-01) -
Using the Logistic Map as Compared to the Cubic Map to Show the Convergence and the Relaxation of the Period–1 Fixed Point
by: Patrick Akwasi Anamuah Mensah, et al.
Published: (2022-01-01)