Sum theorems for maximally monotone operators of type (FPV)
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 ( A)∫e B≠, and A is of type (FPV). We show that when also A is convex, the sum operator: A+B is also of type (FPV). Our result generalizes and unifies several recent sum theorems.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.