Linear Convergence of the Proximal Point Algorithm for Finding Solutions of Structured Convex Optimization Problems in Hilbert Spaces.

Authors

  • Mohamed Soueycatt Tishreen University
  • Boushra Abbas Tishreen University
  • Baydaa Slameh Tishreen University

Abstract

The aim of this research to prove that the linear convergence towards an optimal solution to a structured convex optimization problem in real infinite dimensional Hilbert spaces is in good agreement with the proximal point algorithm. As we show that the proximal point algorithm which is an iterative procedure produces a sequence of better a pproximations to the fixed point of the resolvent operator. And we prove that this sequence is bounded and converges globally towards an optimal solution to the problem of structured convex optimizations and we also prove linear convergence towards the optimal solution of the problem.

Published

2022-08-03

How to Cite

1.
محمد سويقات, بشرى عباس, بيداء سلامة. Linear Convergence of the Proximal Point Algorithm for Finding Solutions of Structured Convex Optimization Problems in Hilbert Spaces. TUJ-BA [Internet]. 2022Aug.3 [cited 2024Nov.29];44(3):121-3. Available from: https://journal.tishreen.edu.sy/index.php/bassnc/article/view/13252