Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 85 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 37 tok/s
GPT-5 High 37 tok/s Pro
GPT-4o 100 tok/s
GPT OSS 120B 473 tok/s Pro
Kimi K2 240 tok/s Pro
2000 character limit reached

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

Published 13 May 2010 in math.FA and math.OC

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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube