A Relaxed Approximate Proximal Point Algorithm

Zhenhua Yang and Bingsheng He ()

Annals of Operations Research, 2005, vol. 133, issue 1, 119-125

Abstract: For a maximal monotone operator T, a well-known overrelaxed point algorithm is often used to find the zeros of T. In this paper, we enhance the algorithm to find a point in $T^{-1}(0)\cap \mathcal{X}$ , where $\mathcal{X}$ is a given closed convex set. In the inexact case of our modified relaxed proximal point algorithm, we give a new criterion. The convergence analysis is quite easy to follow. Copyright Springer Science + Business Media, Inc. 2005

Keywords: proximal point algorithms; monotone operators; inexact; relaxation (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-004-5027-9 (text/html)
Access to full text is restricted to subscribers.

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:annopr:v:133:y:2005:i:1:p:119-125:10.1007/s10479-004-5027-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-004-5027-9

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().