IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v166y2015i1d10.1007_s10957-014-0685-5.html
   My bibliography  Save this article

Comments on “The Proximal Point Algorithm Revisited”

Author

Listed:
  • Yunda Dong

    (Zhengzhou University)

Abstract

Very recently, the author gave an upper bound on a decreasing positive sequence. And, he made use of it to improve a classical result of Brézis and Lions concerning the proximal point algorithm for monotone inclusion in an infinite-dimensional Hilbert space. One assumption is the algorithm’s strong convergence. In this paper, we derive a new upper bound on this decreasing positive sequence and thus achieve the same improvement without requiring this assumption.

Suggested Citation

  • Yunda Dong, 2015. "Comments on “The Proximal Point Algorithm Revisited”," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 343-349, July.
    • Handle: RePEc:spr:joptap:v:166:y:2015:i:1:d:10.1007_s10957-014-0685-5
    DOI: 10.1007/s10957-014-0685-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-014-0685-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/s10957-014-0685-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. A. J. Zaslavski, 2011. "Maximal Monotone Operators and the Proximal Point Algorithm in the Presence of Computational Errors," Journal of Optimization Theory and Applications, Springer, vol. 150(1), pages 20-32, July.
    2. Yunda Dong, 2014. "The Proximal Point Algorithm Revisited," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 478-489, May.
    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. Eike Börgens & Christian Kanzow, 2019. "Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces," Computational Optimization and Applications, Springer, vol. 73(3), pages 755-790, July.
    2. J. Preininger & P. T. Vuong, 2018. "On the convergence of the gradient projection method for convex optimal control problems with bang–bang solutions," Computational Optimization and Applications, Springer, vol. 70(1), pages 221-238, May.

    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. Yunda Dong, 2021. "Weak convergence of an extended splitting method for monotone inclusions," Journal of Global Optimization, Springer, vol. 79(1), pages 257-277, January.
    2. Eike Börgens & Christian Kanzow, 2019. "Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces," Computational Optimization and Applications, Springer, vol. 73(3), pages 755-790, July.
    3. Yunda Dong, 2014. "The Proximal Point Algorithm Revisited," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 478-489, May.

    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:166:y:2015:i:1:d:10.1007_s10957-014-0685-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.