A Proximal Point Method Involving Two Resolvent Operators
Author(s) -
Oganeditse A. Boikanyo
Publication year - 2012
Publication title -
abstract and applied analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.228
H-Index - 56
eISSN - 1687-0409
pISSN - 1085-3375
DOI - 10.1155/2012/892980
Subject(s) - mathematics , iterated function , hilbert space , resolvent , monotone polygon , point (geometry) , sequence (biology) , frame (networking) , construct (python library) , zero (linguistics) , operator (biology) , algorithm , discrete mathematics , pure mathematics , mathematical analysis , computer science , geometry , telecommunications , linguistics , philosophy , biochemistry , chemistry , repressor , biology , transcription factor , gene , genetics , programming language
We construct a sequence of proximal iterates that converges strongly (under minimal assumptions) to a common zero of two maximal monotone operators in a Hilbert space. The algorithm introduced in this paper puts together several proximal point algorithms under one frame work. Therefore, the results presented here generalize and improve many results related to the proximal point algorithm which were announced recently in the literature
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom