Skip to main content
Log in

Approximating zeros of monotone operators by proximal point algorithms

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

Abstract

In this paper, we introduce two kinds of iterative algorithms for the problem of finding zeros of maximal monotone operators. Weak and strong convergence theorems are established in a real Hilbert space. As applications, we consider a problem of finding a minimizer of a convex function.

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. Browder F.E.: Nonlinear operators and nonlinear equations of evolution in Banach spaces. Proc. Symp. Pure Math. 18, 78–81 (1976)

    Google Scholar 

  2. Bruck R.E.: A strongly convergent iterative method for the solution of 0∈Ux for a maximal monotone operator U in Hilbert space. J. Math. Appl. Anal. 48, 114–126 (1974)

    Article  Google Scholar 

  3. Burachik R.S., Iusem A.N., Svaiter B.F.: Enlargement of monotone operators with applications to variational inequalities. Set-valued Anal. 5, 159–180 (1997)

    Article  Google Scholar 

  4. Censor Y., Zenios S.A.: The proximal minimization algorithm with D-functions. J. Optim. Theory Appl. 73, 451–464 (1992)

    Article  Google Scholar 

  5. Cohen G.: Auxiliary problem principle extended to variational inequalities. J. Optim. Theory Appl. 59, 325–333 (1998)

    Google Scholar 

  6. Cho, Y.J., Kang, S.M., Zhou, H.: Approximate proximal point algorithms for finding zeroes of maximal monotone operators in Hilbert spaces. J. Inequal. Appl. 2008 Art. ID 598191. (2008)

  7. Ceng L.C., Wu S.Y., Yao J.C.: New accruacy criteria for modified approximate proximal point algorithms in Hilbert spaces. Taiwanese J. Math. 12, 1691–1705 (2008)

    Google Scholar 

  8. Deimling K.: Zeros of accretive operators. Manuscr. Math. 13, 365–374 (1974)

    Article  Google Scholar 

  9. Dembo R.S., Eisenstat S.C., Steihaug T.: Inexact newton methods. SIAM J. Numer. Anal. 19, 400–408 (1982)

    Article  Google Scholar 

  10. Eckstein J.: Approximate iterations in Bregman-function-based proximal algorithms. Math. Program. 83, 113–123 (1998)

    Google Scholar 

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

    Article  Google Scholar 

  12. Han D.R., He B.S.: A new accuracy criterion for approximate proximal point algorithms. J. Math. Anal. Appl. 263, 343–354 (2001)

    Article  Google Scholar 

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

    Article  Google Scholar 

  14. Kamimura S., Takahashi W.: Strong convergence of a proximal-type algorithm in a Banach space. SIAM J. Optim. 13, 938–945 (2002)

    Article  Google Scholar 

  15. Lan K.Q., Wu J.H.: Convergence of approximants for demicontinuous pseudo-contractive maps in Hilbert spaces. Nonlinear Anal. 49, 737–746 (2002)

    Article  Google Scholar 

  16. Liu L.S.: Ishikawa and Mann iterative processes with errors for nonlinear strongly acretive mappings in Banach spaces. J. Math. Anal. Appl. 194, 114–125 (1995)

    Article  Google Scholar 

  17. Nevanlinna O., Reich S.: Strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces. Isr. J. Math. 32, 44–58 (1979)

    Article  Google Scholar 

  18. Opial Z.: Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 73, 591–597 (1979)

    Article  Google Scholar 

  19. Pazy A.: Remarks on nonlinear ergodic theory in Hilbert spaces. Nonlinear Anal. 6, 863–871 (1979)

    Article  Google Scholar 

  20. Qin X., Su Y.: Approximation of a zero point of accretive operator in Banach spaces. J. Math. Anal. Appl. 329, 415–424 (2007)

    Article  Google Scholar 

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

    Article  Google Scholar 

  22. Solodov M.V., Svaiter B.F.: An inexact hybrid generalized proximal point algorithm and some new result on the theory of Bregman functions. Math. Oper. Res. 25, 214–230 (2000)

    Article  Google Scholar 

  23. Teboulle M.: Convergence of proximal-like algorithms. SIAM J. Optim. 7, 1069–1083 (1997)

    Article  Google Scholar 

  24. Tan K.K., Xu H.K.: Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process. J. Math. Anal. Appl. 178, 301–308 (1993)

    Article  Google Scholar 

  25. Verma R.U.: Rockafellar’s celebrated theorem based on A-maximal monotonicity design. Appl. Math. Lett. 21, 355–360 (2008)

    Article  Google Scholar 

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

    Article  Google Scholar 

  27. Cho Y.J., Zhou H., Guo G.: Weak and strong convergence theorems for three-step iterations with errors for asymptotically nonexpansive mappings. Comput. Math. Appl. 47, 707–717 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yeol Je Cho.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Qin, X., Kang, S.M. & Cho, Y.J. Approximating zeros of monotone operators by proximal point algorithms. J Glob Optim 46, 75–87 (2010). https://doi.org/10.1007/s10898-009-9410-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-009-9410-6

Keywords

AMS Subject Classification (2000)

Navigation