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

From MaRDI portal
Publication:640141

DOI10.1016/J.NA.2011.05.093zbMATH Open1237.47057arXiv1005.2247OpenAlexW2963572150MaRDI QIDQ640141FDOQ640141

Liangjin Yao

Publication date: 17 October 2011

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

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 domAcapintedomBeqvarnothing, A+NoverlinedomB is of type (FPV), and domAcapoverlinedomBsubseteqdomB. The proof utilizes the Fitzpatrick function in an essential way.


Full work available at URL: https://arxiv.org/abs/1005.2247





Cites Work


Cited In (6)






This page was built for publication: The sum of a maximal monotone operator of type (FPV) and a maximal monotone operator with full domain is maximal monotone

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640141)