Skip to main content
Log in

Weak and strong convergence of generalized proximal point algorithms with relaxed parameters

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this work, we propose and study a framework of generalized proximal point algorithms associated with a maximally monotone operator. We indicate sufficient conditions on the regularization and relaxation parameters of generalized proximal point algorithms for the equivalence of the boundedness of the sequence of iterations generated by this algorithm and the non-emptiness of the zero set of the maximally monotone operator, and for the weak and strong convergence of the algorithm. Our results cover or improve many results on generalized proximal point algorithms in our references. Improvements of our results are illustrated by comparing our results with related known ones.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. As is the custom, in the whole work, we use the empty sum convention and empty product convention, that is, given a sequence \((t_{k})_{ k\in {\mathbb {N}}}\) in \({\mathbb {R}}\), for every m and n in \({\mathbb {N}}\) with \(m > n\), we have \(\sum ^{n}_{i=m} t_{i} =0\) and \(\prod ^{n}_{i=m} t_{i} =1\).

References

  1. Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer (2017)

    Book  MATH  Google Scholar 

  2. Boikanyo, O.A., Moroşanu, G.: A proximal point algorithm converging strongly for general errors. Optim. Lett. 4, 635–641 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Corman, E., Yuan, X.: A generalized proximal point algorithm and its convergence rate. SIAM J. Optim. 24, 1614–1638 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  4. Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293–318 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gol’shtein, E.G., Tret’yakov, N.V.: Modified Lagrangians in convex programming and their generalizations. Math. Program. Study 10, 86–97 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  6. Güler, O.: On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29, 403–419 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lehdili, N., Moudafi, A.: Combining the proximal algorithm and Tikhonov regularization. Optimization 37, 239–252 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Marino, G., Xu, H.: Convergence of generalized proximal point algorithms. Commun. Pure Appl. Anal. 3, 791–808 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ouyang, H.: On the Stability of Krasnosel’skiǐ-Mann Iterations, arXiv: 2203.04527 (2022), 1–30

  10. Ouyang, H.: Linear Convergence of Generalized Proximal Point Algorithms for Monotone Inclusion Problems, arXiv: 2203.10720 (2022), 1–30

  11. Rockafellar, T.R.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877–898 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  12. Solodov, M.V., Svaiter, B.F.: Forcing strong convergence of proximal point iterations in a Hilbert space. Math. Program. 87, 189–202 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  13. Suzuki, T.: Strong convergence theorems for infinite families of nonexpansive mappings in general Banach spaces. Fixed Point Theory Appl. 1, 103–123 (2005)

    MathSciNet  MATH  Google Scholar 

  14. Tao, M., Yuan, X.: On the optimal linear convergence rate of a generalized proximal point algorithm. J. Sci. Comput. 74, 826–850 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  15. Xu, H.: Iterative algorithms for nonlinear operators. J. Lond. Math. Soc. 66, 240–256 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Xu, H.: A regularization method for the proximal point algorithm. J. Glob. Optim. 36, 115–125 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Yao, Y., Noor, M.A.: On convergence criteria of generalized proximal point algorithms. J. Comput. Appl. Math. 217, 46–55 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Yao, Y., Shahzad, N.: Strong convergence of a proximal point algorithm with general errors. Optim. Lett. 6, 621–628 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  19. Wang, F.: A note on the regularized proximal point algorithm. J. Glob. Optim. 50, 531–535 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hui Ouyang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ouyang, H. Weak and strong convergence of generalized proximal point algorithms with relaxed parameters. J Glob Optim 85, 969–1002 (2023). https://doi.org/10.1007/s10898-022-01241-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-022-01241-0

Keywords

Mathematics Subject Classification

Navigation