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

    Authors

    R. U. Verma

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Appl. Math. Lett.

    Keywords

    inclusion problems; maximal monotone mapping; A-maximal monotone; mapping; generalized resolvent operator; PROXIMAL POINT ALGORITHM; VARIATIONAL INCLUSIONS; SPLITTING METHOD; OPERATORS; Mathematics, Applied

    Abstract

    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.

    Journal Title

    Applied Mathematics Letters

    Volume

    21

    Issue/Number

    4

    Publication Date

    1-1-2008

    Document Type

    Article

    Language

    English

    First Page

    355

    Last Page

    360

    WOS Identifier

    WOS:000255163100008

    ISSN

    0893-9659

    Share

    COinS