On convergence criteria of generalized proximal point algorithms (Q929905): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cam.2007.06.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026821674 / rank | |||
Normal rank | |||
Revision as of 01:56, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On convergence criteria of generalized proximal point algorithms |
scientific article |
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
