2000 character limit reached
Sum theorems for maximally monotone operators of type (FPV)
Published 29 May 2013 in math.FA | (1305.6691v1)
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. In this paper, we establish the maximal monotonicity of $A+B$ provided that $A$ and $B$ are maximally monotone operators such that $\sta(\dom A)\cap\inte\dom B\neq\varnothing$, and $A$ is of type (FPV). We show that when also $\dom A$ is convex, the sum operator: $A+B$ is also of type (FPV). Our result generalizes and unifies several recent sum theorems.
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.