On convergence criteria of generalized proximal point algorithms (Q929905)
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: On convergence criteria of generalized proximal point algorithms |
scientific article; zbMATH DE number 5290873
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On convergence criteria of generalized proximal point algorithms |
scientific article; zbMATH DE number 5290873 |
Statements
On convergence criteria of generalized proximal point algorithms (English)
0 references
19 June 2008
0 references
The authors analyze some generalized proximal point algorithms for finding a zero of maximal monotone operators, which include the previously known proximal point algorithms as special cases. Weak and strong convergence of the proposed proximal point algorithms are proved under some mild conditions. No numerical tests are presented.
0 references
maximal monotone operator
0 references
proximal point algorithm
0 references
nonexpansive mapping
0 references
resolvent identity
0 references
convergence
0 references
variational inequality
0 references
0 references
0 references
0.9791318
0 references
0.96284646
0 references
0.9579913
0 references
0.9448962
0 references
0.94072604
0 references
0.94048727
0 references
0.9371822
0 references
0.9317815
0 references
0 references
0.9286258
0 references
