Asymptotic regularity and the strong convergence of the proximal point algorithm (Q1069272)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Asymptotic regularity and the strong convergence of the proximal point algorithm |
scientific article; zbMATH DE number 3934322
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotic regularity and the strong convergence of the proximal point algorithm |
scientific article; zbMATH DE number 3934322 |
Statements
Asymptotic regularity and the strong convergence of the proximal point algorithm (English)
0 references
1983
0 references
A fundamental method for finding a solution to an equation \(O\in Ax\) with A being a multi-valued maximal monotone operator is Rockafellar's proximal point algorithm. The authors of this paper gives several sufficient conditions for the strong convergence of the algorithm. The proofs are based on a result on the asymptotic regularity of nonexpansive mappings.
0 references
multi-valued maximal monotone operator
0 references
Rockafellar's proximal point algorithm
0 references
strong convergence
0 references
asymptotic regularity
0 references
nonexpansive mappings
0 references
0.9590509
0 references
0.94847965
0 references
0.9470241
0 references
0.9443039
0 references
0.93811196
0 references
0.9375453
0 references
0.93260443
0 references
0.93192416
0 references
