A modified inertial projected forward–backward algorithm for convex optimization problems
摘要
The primary objective of this study is to establish the convergence theorem associated with the modified inertial projected forward–backward algorithm using line search techniques. Many applications in applied sciences can be modeled as constrained convex minimization problems. Our numerical experiments offer practical applications for resolving image deblurring issues. The results of our numerical analysis conclusively indicate that the proposed algorithms exhibit greater efficiency than those previously introduced in the literature.