Comments on “The Proximal Point Algorithm Revisited”

Yunda Dong ()
Additional contact information
Yunda Dong: Zhengzhou University

Journal of Optimization Theory and Applications, 2015, vol. 166, issue 1, No 17, 343-349

Abstract: 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.

Keywords: Monotone inclusion; Convex minimization; Proximal point algorithm; Rate of convergence; 58E35; 65K15 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-014-0685-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:166:y:2015:i:1:d:10.1007_s10957-014-0685-5

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-014-0685-5

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().