Maximality of the sum of the subdifferential operator and a maximally monotone operator

Abstract

The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that the classical Rockafellar's constraint qualification holds, which is called the "sum problem". In this paper, we establish the maximal monotonicity of $A+B$ provided that $A$ and $B$ are maximally monotone operators such that $\dom A\cap\inte\dom B\neq\varnothing$, and $A+N_{\overline{\dom A}}$ is of type (FPV). This generalizes various current results and also gives an affirmative answer to a problem posed by Borwein and Yao. Moreover, we present an equivalent description of the sum problem.

16 pages. arXiv admin note: text overlap with arXiv:1305.6691

References in corpus (2)

• The sum of a maximal monotone operator of type (FPV) and a maximal monotone operator with full domain is maximal monotone
• On the Regularity of Maximal Monotone Operators and Related Results