𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

✍ Scribed by Hedy Attouch; Jérôme Bolte

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
178 KB
Volume
116
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A remark on the strong convergence of th
A remark on the strong convergence of the over-relaxed proximal point algorithm
✍ Zhenyu Huang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 233 KB

This paper illustrates that the conditions and the main proof of two main theorems of Verma [R.U. Verma, The over-relaxed proximal point algorithm based on H-maximal monotonicity design and applications, Computers and Mathematics with Applications 55 (2008) 2673-2679] concerning the strong convergen

A New Numerical Algorithm for the Analyt
A New Numerical Algorithm for the Analytic Continuation of Green's Functions
✍ Vincent D. Natoli; Morrel H. Cohen; Bengt Fornberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 318 KB

to continue the result to the real axis. Numerical analytic continuation, however, is notoriously difficult, and most The need to calculate the spectral properties of a Hermitian operator H frequently arises in the technical sciences. A common ap-techniques developed thus far are useful only for sp

On the convergence analysis of inexact h
On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators
✍ Lu-Chuan Ceng; Jen-Chih Yao 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 192 KB

In this paper we introduce general iterative methods for finding zeros of a maximal monotone operator in a Hilbert space which unify two previously studied iterative methods: relaxed proximal point algorithm [H.K. Xu, Iterative algorithms for nonlinear operators, J. London Math Soc. 66 (2002) 240-25