IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v83y2022i1d10.1007_s10589-022-00397-5.html
   My bibliography  Save this article

Abstract strongly convergent variants of the proximal point algorithm

Author

Listed:
  • Andrei Sipoş

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

Abstract

We prove an abstract form of the strong convergence of the Halpern-type and Tikhonov-type proximal point algorithms in CAT(0) spaces. In addition, we derive uniform and computable rates of metastability (in the sense of Tao) for these iterations using proof mining techniques.

Suggested Citation

  • Andrei Sipoş, 2022. "Abstract strongly convergent variants of the proximal point algorithm," Computational Optimization and Applications, Springer, vol. 83(1), pages 349-380, September.
    • Handle: RePEc:spr:coopap:v:83:y:2022:i:1:d:10.1007_s10589-022-00397-5
    DOI: 10.1007/s10589-022-00397-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-022-00397-5
    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-022-00397-5?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. David Ariza-Ruiz & Genaro López-Acedo & Adriana Nicolae, 2015. "The Asymptotic Behavior of the Composition of Firmly Nonexpansive Mappings," Journal of Optimization Theory and Applications, Springer, vol. 167(2), pages 409-429, November.
    2. 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.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    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. Ítalo Dowell Lira Melo & João Xavier Cruz Neto & José Márcio Machado Brito, 2022. "Strong Convergence of Alternating Projections," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 306-324, 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. José Márcio Machado Brito & João Xavier Cruz Neto & Ítalo Dowell Lira Melo, 2024. "Strong convergence of the composition of firmly nonexpansive mappings," Journal of Global Optimization, Springer, vol. 90(4), pages 891-907, December.
    4. Byoung Jin Choi, 2020. "Δ-Convergence of Products of Operators in p -Uniformly Convex Metric Spaces," Mathematics, MDPI, vol. 8(5), pages 1-8, May.
    5. Sakan Termkaew & Parin Chaipunya & Fumiaki Kohsaka, 2023. "Infinite Product and Its Convergence in CAT(1) Spaces," Mathematics, MDPI, vol. 11(8), pages 1-17, April.
    6. 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.
    7. Alexander Lytchak & Anton Petrunin, 2022. "Cyclic Projections in Hadamard Spaces," Journal of Optimization Theory and Applications, Springer, vol. 194(2), pages 636-642, August.

    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:83:y:2022:i:1:d:10.1007_s10589-022-00397-5. 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.