Rockafellar’s celebrated theorem based on A -maximal monotonicity design

详细信息    查看全文

• 作者：Ram U. Verma
• 关键词：Inclusion problems ; Maximal monotone mapping ; ; none ; color ; black"" href=""/science?_ob=MathURL&_method=retrieve&_udi=B6TY9-4NWCGTR-1&_mathId=mml6&_user=1067359&_cdi=5613&_rdoc=9&_acct=C000050221&_version=1&_userid
• 刊名：Applied Mathematics Letters
• 出版年：2008
• 出版时间：April 2008
• 年：2008
• 卷：21
• 期：4
• 页码：355-360
• 全文大小：168 K

文摘

A generalization to Rockafellar’s theorem (1976) in the context of approximating a solution to a general inclusion problem involving a set-valued edaa1e36f9"" title=""Click to view the MathML source"" alt=""Click to view the MathML source"">A-maximal monotone mapping using the proximal point algorithm in a Hilbert space setting is presented. Although there exists a vast literature on this theorem, most of the studies are focused on just relaxing the proximal point algorithm and applying to the inclusion problems. The general framework for A-maximal monotonicity (also referred to as the A-monotonicity framework in literature) generalizes the general theory of set-valued maximal monotone mappings, including the H-maximal monotonicity (also referred to as H-monotonicity).