Skip to main content
Log in

On the Strong Convergence of Halpern Type Proximal Point Algorithm

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

The main result of this paper is to prove the strong convergence of the sequence generated by the proximal point algorithm of Halpern type to a zero of a maximal monotone operator under the suitable assumptions on the parameters and error. The results extend some of the previous results or give some different conditions for convergence of the sequence. It is also indicated that when the maximal monotone operator is the subdifferential of a convex, proper, and lower semicontinuous function, the results extend all previous results in the literature. We also prove the boundedness of the sequence generated by the algorithm with a weak coercivity condition defined in the paper and without any additional assumptions on the parameters.

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

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Brézis, H., Lions, P.L.: Produits infinis de résolvantes. Isr. J. Math. 29, 329–345 (1978)

    Article  MATH  Google Scholar 

  3. Djafari Rouhani, B., Khatibzadeh, H.: On the proximal point algorithm. J. Optim. Theory Appl. 137, 411–417 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Khatibzadeh, H.: Some remarks on the proximal point algorithm. J. Optim. Theory Appl. 153, 769–778 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. 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 

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

    Article  MATH  Google Scholar 

  7. Kamimura, S., Takahashi, W.: Approximating solutions of maximal monotone operators in Hilbert spaces. J. Approx. Theory 106, 226–240 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  8. He, Z., Zhang, D., Gu, F.: Viscosity approximation method for m-accretive mapping and variational inequality in Banach space. An. Stiint. Univ. Ovidius Constanta Ser. Mat. 17, 91–104 (2009)

    MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Boikanyo, O.A., Morosanu, G.: Modified Rockafellar’s algorithms. Math. Sci. Res. J. 13, 101–122 (2009)

    MathSciNet  MATH  Google Scholar 

  14. Boikanyo, O.A., Morosanu, G.: Inexact Halpern-type proximal point algorithm. J. Glob. Optim. 51, 11–26 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Boikanyo, O.A., Morosanu, G.: Four parameter proximal point algorithms. Nonlinear Anal. 74, 544–555 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  16. Wang, F., Cui, H.: On the contraction proximal point algorithms with multi parameters. J. Glob. Optim. Preprint. doi:10.1007/s10898-011-9772-4

  17. Morosanu, G.: Nonlinear Evolution Equations and Applications. Mathematics and Its Applications, vol. 26. Reidel, Dordrecht (1988)

    MATH  Google Scholar 

  18. Khatibzadeh, H.: Asymptotic behavior of a discrete nonlinear oscillator with damping dynamical system. Adv. Differ. Equ. 2011, 867136 (2011), 9 pp.

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This research was in part supported by a grant from University of Zanjan (No. 9041). The authors would like to thank the referee for valuable comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hadi Khatibzadeh.

Additional information

Communicated by Nicolas Hadjisavvas.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khatibzadeh, H., Ranjbar, S. On the Strong Convergence of Halpern Type Proximal Point Algorithm. J Optim Theory Appl 158, 385–396 (2013). https://doi.org/10.1007/s10957-012-0213-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-012-0213-4

Keywords

Navigation