A Fast Fixed-Point Algorithm for Convex Minimization Problems and Its Application in Image Restoration Problems

Authors:

Open Access

17 October 2021

journal article
research article
Published by MDPI AG in Mathematics

Vol. 9 (20) , 2619
DOI:10.3390/math9202619

Abstract

In this paper, we introduce a new iterative method using an inertial technique for approximating a common fixed point of an infinite family of nonexpansive mappings in a Hilbert space. The proposed method’s weak convergence theorem was established under some suitable conditions. Furthermore, we applied our main results to solve convex minimization problems and image restoration problems.

Keywords

This publication has 35 references indexed in Scilit:

On the rate of convergence of Mann, Ishikawa, Noor and SP-iterations for continuous functions on an arbitrary interval
Journal of Computational and Applied Mathematics, 2011
On strong convergence by the hybrid method for families of mappings in Hilbert spaces
Nonlinear Analysis, 2008
A unified treatment of some iterative algorithms in signal processing and image reconstruction
Inverse Problems, 2003
Convergence of a splitting inertial proximal method for monotone operators
Journal of Computational and Applied Mathematics, 2003
Iterative oblique projection onto convex sets and the split feasibility problem
Inverse Problems, 2002
Quasi-Fejérian Analysis of Some Optimization Algorithms
2001
Algorithms for the regularization of ill-conditioned least squares problems
BIT Numerical Mathematics, 1977
Fixed points by a new iteration method
Proceedings of the American Mathematical Society, 1974
Some methods of speeding up the convergence of iteration methods
USSR Computational Mathematics and Mathematical Physics, 1964
Mean value methods in iteration
Proceedings of the American Mathematical Society, 1953