The sum of a maximal monotone operator of type (FPV) and a maximal monotone operator with full domain is maximal monotone (Q640141)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The sum of a maximal monotone operator of type (FPV) and a maximal monotone operator with full domain is maximal monotone
scientific article

    Statements

    The sum of a maximal monotone operator of type (FPV) and a maximal monotone operator with full domain is maximal monotone (English)
    0 references
    0 references
    17 October 2011
    0 references
    In [Trans. Am. Math. Soc. 149, 75--88 (1970; Zbl 0222.47017)], \textit{R. T. Rockafellar} proved that the sum \(A+B\) of two maximal monotone operators \(A,B: X\rightrightarrows X^*\) is maximal monotone if \(X\) is a reflexive Banach space and if the constraint qualification \((\text{dom\,}A)\cap(\text{int\, dom\,}B)\neq \emptyset\) holds. In the present paper, the author provides an extension of this result to nonreflexive Banach spaces, assuming the following three sufficient conditions: (1) \((\text{dom\,}A)\cap(\text{int\,dom\,}B)\neq\emptyset\); (2) \(A+N_{\overline{\text{dom\,}B}}\) is of type (FPV), i.e., maximal monotone locally in the sense of \textit{S. Fitzpatrick} and \textit{R. R. Phelps} [Ann. Inst. Henri Poincaré, Anal. Non Linéaire 9, No.~5, 573--595 (1992; Zbl 0818.47052)] and \textit{M. E. Verona} and \textit{A. Verona} [Nonlinear Anal., Theory Methods Appl. 19, No.~10, 977--982 (1992; Zbl 0782.47043)]; (3) \((\text{dom\,}A)\cap(\overline{\text{dom\,} B})\subset \text{dom\,}B\). Clearly, the sufficient conditions are fulfilled if the mapping \(A\) is of type (FPV) and \(B\) has full domain.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximal monotone operator
    0 references
    constraint qualification
    0 references
    subdifferential
    0 references
    monotone operator of type (FPV)
    0 references
    Fitzpatrick function
    0 references
    0 references
    0 references