IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v79y2021i1d10.1007_s10589-021-00263-w.html
   My bibliography  Save this article

Quantitative results on a Halpern-type proximal point algorithm

Author

Listed:
  • Laurenţiu Leuştean

    (University of Bucharest
    Simion Stoilow Institute of Mathematics of the Romanian Academy)

  • Pedro Pinto

    (Technische Universität Darmstadt)

Abstract

We apply proof mining methods to analyse a result of Boikanyo and Moroşanu on the strong convergence of a Halpern-type proximal point algorithm. As a consequence, we obtain quantitative versions of this result, providing uniform effective rates of asymptotic regularity and metastability.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:coopap:v:79:y:2021:i:1:d:10.1007_s10589-021-00263-w
    DOI: 10.1007/s10589-021-00263-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-021-00263-w
    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/s10589-021-00263-w?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. O. Boikanyo & G. Moroşanu, 2011. "Inexact Halpern-type proximal point algorithm," Journal of Global Optimization, Springer, vol. 51(1), pages 11-26, September.
    2. 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.
    3. Laurenţiu Leuştean & Adriana Nicolae & Andrei Sipoş, 2018. "An abstract proximal point algorithm," Journal of Global Optimization, Springer, vol. 72(3), pages 553-577, November.
    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. Andrei Sipoş, 2022. "Abstract strongly convergent variants of the proximal point algorithm," Computational Optimization and Applications, Springer, vol. 83(1), pages 349-380, September.

    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. 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.
    2. 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.
    3. Haibin Zhang & Juan Wei & Meixia Li & Jie Zhou & Miantao Chao, 2014. "On proximal gradient method for the convex problems regularized with the group reproducing kernel norm," Journal of Global Optimization, Springer, vol. 58(1), pages 169-188, January.
    4. 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.
    5. J. H. Wang & C. Li & J.-C. Yao, 2015. "Finite Termination of Inexact Proximal Point Algorithms in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 188-212, July.
    6. 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.
    7. Andrei Sipoş, 2022. "Abstract strongly convergent variants of the proximal point algorithm," Computational Optimization and Applications, Springer, vol. 83(1), pages 349-380, September.

    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:coopap:v:79:y:2021:i:1:d:10.1007_s10589-021-00263-w. 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.