Maximality of the sum of the subdifferential operator and a maximally monotone operator
Functional Analysis
2014-07-01 v1
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 provided that and are maximally monotone operators such that , and 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.
Keywords
Cite
@article{arxiv.1406.7664,
title = {Maximality of the sum of the subdifferential operator and a maximally monotone operator},
author = {Liangjin Yao},
journal= {arXiv preprint arXiv:1406.7664},
year = {2014}
}
Comments
16 pages. arXiv admin note: text overlap with arXiv:1305.6691