The sum of a maximal monotone operator of type (FPV) and a maximal monotone operator with full domain is maximal monotone
Abstract: The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximal monotone operators provided that Rockafellar's constraint qualification holds. In this paper, we prove the maximal monotonicity of $A+B$ provided that $A$ and $B$ are maximal monotone operators such that $\dom A\cap\inte\dom B\neq\varnothing$, $A+N_{\overline{\dom B}}$ is of type (FPV), and $\dom A\cap\overline{\dom B}\subseteq\dom B$. The proof utilizes the Fitzpatrick function in an essential way.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.