IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v174y2017i2d10.1007_s10957-017-1117-0.html
   My bibliography  Save this article

Hybrid Proximal Point Algorithm and Applications to Equilibrium Problems and Convex Programming

Author

Listed:
  • Vahid Dadashi

    (Islamic Azad University)

  • Mihai Postolache

    (China Medical University
    University Politehnica of Bucharest)

Abstract

In this paper, a hybrid projection algorithm for a countable family of mappings is considered in Banach spaces. The sequence generated by algorithm converges strongly to the common fixed point of the mappings. We apply the result for the resolvent of a maximal monotone operator for finding a zero of it, which is a solution of the equilibrium problem. The results obtained extend the research in this context, such as the corresponding results of Aoyama et al. (Nonlinear Anal 71(12):1626–1632, 2009, nonlinear analysis and optimization, Yokohama Publishers, Yokohama, pp. 1–17, 2009), Solodov et al. (Math Program 87(1):189–202, 2000), Ohsawa et al. (Arch Math 81(4):439–445, 2003) and Kamimura et al. (SIAM J Optim 13(3):938–945, 2002).

Suggested Citation

  • Vahid Dadashi & Mihai Postolache, 2017. "Hybrid Proximal Point Algorithm and Applications to Equilibrium Problems and Convex Programming," Journal of Optimization Theory and Applications, Springer, vol. 174(2), pages 518-529, August.
    • Handle: RePEc:spr:joptap:v:174:y:2017:i:2:d:10.1007_s10957-017-1117-0
    DOI: 10.1007/s10957-017-1117-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-017-1117-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-017-1117-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hadi Khatibzadeh, 2012. "Some Remarks on the Proximal Point Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 769-778, June.
    2. B. Djafari Rouhani & H. Khatibzadeh, 2008. "On the Proximal Point Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 137(2), pages 411-417, May.
    3. Hadi Khatibzadeh & Sajad Ranjbar, 2013. "On the Strong Convergence of Halpern Type Proximal Point Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 158(2), pages 385-396, August.
    4. L. Li & W. Song, 2008. "Modified Proximal-Point Algorithm for Maximal Monotone Operators in Banach Spaces," Journal of Optimization Theory and Applications, Springer, vol. 138(1), pages 45-64, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Annel Thembinkosi Bokodisa & Lateef Olakunle Jolaoso & Maggie Aphane, 2021. "Halpern-Subgradient Extragradient Method for Solving Equilibrium and Common Fixed Point Problems in Reflexive Banach Spaces," Mathematics, MDPI, vol. 9(7), pages 1-24, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hadi Khatibzadeh & Sajad Ranjbar, 2013. "On the Strong Convergence of Halpern Type Proximal Point Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 158(2), pages 385-396, August.
    2. L. C. Ceng & G. Mastroeni & J. C. Yao, 2009. "Hybrid Proximal-Point Methods for Common Solutions of Equilibrium Problems and Zeros of Maximal Monotone Operators," Journal of Optimization Theory and Applications, Springer, vol. 142(3), pages 431-449, September.
    3. Behzad Djafari Rouhani & Sirous Moradi, 2019. "Strong Convergence of Regularized New Proximal Point Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 181(3), pages 864-882, June.
    4. Hadi Khatibzadeh, 2012. "Some Remarks on the Proximal Point Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 769-778, June.
    5. Behzad Djafari Rouhani & Sirous Moradi, 2017. "Strong Convergence of Two Proximal Point Algorithms with Possible Unbounded Error Sequences," Journal of Optimization Theory and Applications, Springer, vol. 172(1), pages 222-235, January.
    6. Behzad Djafari Rouhani & Vahid Mohebbi, 2020. "Strong Convergence of an Inexact Proximal Point Algorithm in a Banach Space," Journal of Optimization Theory and Applications, Springer, vol. 186(1), pages 134-147, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:174:y:2017:i:2:d:10.1007_s10957-017-1117-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.