Convergence of generalized proximal point algorithms

被引：156

作者：

Marino, G ^{[1
]}

Xu, HK

机构：

[1] Univ Calabria, Dipartimento Matemat, I-87036 Arcavacata Di Rende, Italy

[2] Univ KwaZulu Natal, Sch Math Sci, ZA-4000 Durban, South Africa

来源：

COMMUNICATIONS ON PURE AND APPLIED ANALYSIS | 2004年 / 3卷 / 04期

关键词：

maximal monotone operator; generalized (contraction-; inexact) proximal point algorithm; resolvent identity; nonexpansive mapping; projection;

D O I：

10.3934/cpaa.2004.3.791

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Weak and strong convergence for some generalized proximal point algorithms are proved. These algorithms include the Eckstein and Bertsekas generalized proximal point algorithm, a contract ion-proximal point algorithm, and inexact proximal point algorithms. Convergence rate is also considered.

引用

页码：791 / 808

页数：18

共 22 条

[1]

Barbu V., 1976, NONLINEAR SEMIGROUPS

[2]

BREZIS H., 1973, North-Holland Math. Stud., V5

[3] A variable metric proximal point algorithm for monotone operators [J].