Abstract
In algorithm development, symmetry plays a vital part in managing optimization problems in scientific models. The aim of this work is to propose a new accelerated method for finding a common point of convex minimization problems and then use the fixed point of the forward-backward operator to explain and analyze a weak convergence result of the proposed algorithm in real Hilbert spaces under certain conditions. As applications, we demonstrate the suggested method for solving image inpainting and image restoration problems.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference26 articles.
1. Bertsekas, D.P., and Tsitsiklis, J.N. (1997). Parallel and Distributed Computation: Numerical Methods, Athena Scientific.
2. A Douglas-Rachford splitting approach to nonsmooth convex variational signal recovery;Combettes;IEEE J. Sel. Top. Signal Process.,2007
3. Signal recovery by proximal forward-backward splitting;Combettes;Multiscale Model. Simul.,2005
4. An inertial alternating projection algorithm for convex minimization problems with applications to signal recovery problems;Hanjing;J. Nonlinear Convex Anal.,2022
5. A general iterative method for hierarchical variational inequality problems in Hilbert spaces and applications;Lin;Positivity,2012