Rockafellar's celebrated theorem based on A-maximal monotonicity design
Abbreviated Journal Title
Appl. Math. Lett.
inclusion problems; maximal monotone mapping; A-maximal monotone; mapping; generalized resolvent operator; PROXIMAL POINT ALGORITHM; VARIATIONAL INCLUSIONS; SPLITTING METHOD; OPERATORS; Mathematics, Applied
A generalization to Rockfellar's theorem (1976) in the context of approximating a solution to a general inclusion problem involving a set-valued A-maximal monotone mapping using the proximal point algorithm in a Hilbert space setting is presented. Although (here exists a vast literature oil this theorem, most of the studies are focused on just relaxing the proximal point algorithm and applying to file 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 file H-maximal monotonicity (also referred to as H-monotonicity). (C) 2007 Elsevier Ltd. All rights reserved.
Applied Mathematics Letters
"Rockafellar's celebrated theorem based on A-maximal monotonicity design" (2008). Faculty Bibliography 2000s. 1090.