Abstract
We provide quantitative information in the form of a rate of metastability in the sense of T. Tao and (under a metric regularity assumption) a rate of convergence for an algorithm approximating zeros of differences of maximally monotone operators due to A. Moudafi by using techniques from ‘proof mining’, a subdiscipline of mathematical logic. For the rate of convergence, we provide an abstract and general result on the construction of rates of convergence for quasi-Fejér monotone sequences with metric regularity assumptions, generalizing previous results for Fejér monotone sequences due to U. Kohlenbach, G. López-Acedo and A. Nicolae.
| Original language | English |
|---|---|
| Pages (from-to) | 295-315 |
| Number of pages | 21 |
| Journal | Journal of Convex Analysis |
| Volume | 30 |
| Issue number | 1 |
| Early online date | 1 Mar 2023 |
| DOIs | |
| Publication status | Published - 1 Mar 2023 |
Keywords
- DC programming
- Fejér monotonicity
- Maximally monotone operators
- proof mining
- Zeros of set-valued operators
ASJC Scopus subject areas
- Analysis
- General Mathematics
Fingerprint
Dive into the research topics of 'Quantitative Results on Algorithms for Zeros of Differences of Monotone Operators in Hilbert Space'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS