New fast proximal point algorithms for monotone inclusion problems with applications to image recovery
The proximal point algorithm has many applications for convex optimization with several versions of the proximal point algorithm including generalized proximal point algorithms and accelerated proximal point algorithms that have been studied in the literature. In this paper, we propose accelerated v...
Saved in:
Published in | Optimization Vol. 74; no. 10; pp. 2369 - 2394 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Taylor & Francis
27.07.2025
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The proximal point algorithm has many applications for convex optimization with several versions of the proximal point algorithm including generalized proximal point algorithms and accelerated proximal point algorithms that have been studied in the literature. In this paper, we propose accelerated versions of generalized proximal point algorithms to find a zero of a maximal monotone operator in Hilbert spaces. We give both weak and linear convergence results of our proposed algorithms under standard conditions. Numerical applications of our results to image recovery are given and numerical implementations show that our algorithms are effective and superior to other related accelerated proximal point algorithms in the literature. |
---|---|
ISSN: | 0233-1934 1029-4945 |
DOI: | 10.1080/02331934.2024.2345761 |