In this paper, we introduce a new accelerated iterative method for finding a common fixed point of a countable family of nonexpansive mappings in the Hilbert spaces framework. Using our main result, we obtain a new accelerated image restoration iterative method for solving a minimization problem in the form of the sum of two proper lower semi-continuous and convex functions. As applications, we apply our algorithm to solving image restoration problems.
Iterative methods for optimization problems and image restoration
Padcharoen, Anantachai and Kitkuan, Duangkamon
Full PDF
carpathian_2021_37_3_497_512Additional Information
| Author(s) | Kitkuan, Duangkamon, Padcharoen, Anantachai |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2021.03.12 |
Recently posted
-
Efficient nonlinear conjugate gradient techniques for vector optimization problems
-
Characterizations of ɛ-Approximate Solutions for Robust Convex Semidefinite Programming Problems
-
A New Viscosity Approximation Method with Inertial Technique for Convex Bilevel Optimization Problems and Applications
-
Necessary and sufficient optimality conditions for reverse quasiconvex programs
-
On approximating fixed points of strictly pseudocontractive mappings in metric spaces
-
Two inertial projective Mann forward-backward algorithm for variational inclusion problems and application to stroke prediction
-
Proximal point approach for solving convex minimization problems in positive curvature
-
An intermixed algorithm for solving fixed point problems of proximal operators in Hilbert Spaces
-
Inertial Krasnosel’skiĭ-Mann iterative algorithm with step-size parameters involving nonexpansive mappings with applications to solve image restoration problems
-
Levitin-Polyak well-posedness for generalized (η,g,φ)-mixed vector variational-type inequality