IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v181y2019i3d10.1007_s10957-019-01497-9.html
   My bibliography  Save this article

Strong Convergence of Regularized New Proximal Point Algorithms

Author

Listed:
  • Behzad Djafari Rouhani

    (University of Texas at El Paso)

  • Sirous Moradi

    (Arak University)

Abstract

We consider the regularization of two proximal point algorithms (PPA) with errors for a maximal monotone operator in a real Hilbert space, previously studied, respectively, by Xu, and by Boikanyo and Morosanu, where they assumed the zero set of the operator to be nonempty. We provide a counterexample showing an error in Xu’s theorem, and then we prove its correct extended version by giving a necessary and sufficient condition for the zero set of the operator to be nonempty and showing the strong convergence of the regularized scheme to a zero of the operator. This will give a first affirmative answer to the open question raised by Boikanyo and Morosanu concerning the design of a PPA, where the error sequence tends to zero and a parameter sequence remains bounded. Then, we investigate the second PPA with various new conditions on the parameter sequences and prove similar theorems as above, providing also a second affirmative answer to the open question of Boikanyo and Morosanu. Finally, we present some applications of our new convergence results to optimization and variational inequalities.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:181:y:2019:i:3:d:10.1007_s10957-019-01497-9
    DOI: 10.1007/s10957-019-01497-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-019-01497-9
    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-019-01497-9?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. Yamin Wang & Fenghui Wang & Hong-Kun Xu, 2016. "Error Sensitivity for Strongly Convergent Modifications of the Proximal Point Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 901-916, March.
    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. 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.
    4. Fenghui Wang, 2011. "A note on the regularized proximal point algorithm," Journal of Global Optimization, Springer, vol. 50(3), pages 531-535, 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. 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.

    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. 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.
    2. Laurenţiu Leuştean & Pedro Pinto, 2021. "Quantitative results on a Halpern-type proximal point algorithm," Computational Optimization and Applications, Springer, vol. 79(1), pages 101-125, May.
    3. Hadi Khatibzadeh, 2012. "Some Remarks on the Proximal Point Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 769-778, June.
    4. 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.
    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. Gheorghe Moroşanu & Adrian Petruşel, 2019. "A Proximal Point Algorithm Revisited and Extended," Journal of Optimization Theory and Applications, Springer, vol. 182(3), pages 1120-1129, September.
    7. Fenghui Wang & Huanhuan Cui, 2012. "On the contraction-proximal point algorithms with multi-parameters," Journal of Global Optimization, Springer, vol. 54(3), pages 485-491, November.
    8. Fenghui Wang, 2022. "The Split Feasibility Problem with Multiple Output Sets for Demicontractive Mappings," Journal of Optimization Theory and Applications, Springer, vol. 195(3), pages 837-853, December.
    9. Yamin Wang & Fenghui Wang & Hong-Kun Xu, 2016. "Error Sensitivity for Strongly Convergent Modifications of the Proximal Point Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 901-916, March.
    10. 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.
    11. Hui Ouyang, 2023. "Weak and strong convergence of generalized proximal point algorithms with relaxed parameters," Journal of Global Optimization, Springer, vol. 85(4), pages 969-1002, April.

    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:181:y:2019:i:3:d:10.1007_s10957-019-01497-9. 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.