כתבה
arXiv cs.LG ·
Nonmaximal sums of maximally monotone operators under Rockafellar's constraint qualification
תקציר מקורי באנגליתarXiv:2609.10487v4 Announce Type: replace Abstract: We construct counterexamples to Rockafellar's sum conjecture in which two maximally monotone operators satisfy the interior-domain condition but their sum is not maximally monotone, thereby providing the complete disproof of the conjecture. We establish a general construction theorem that computes the entire monotone polar of a class of graphs and characterizes their maximal monotonicity by the nonexistence of solutions to explicit equations in the continuous dual. We also prove a pullback theorem that transfers counterexamples through bounded linear surjections. These theorems provide a systematic mechanism for generating entire families of counterexamples and lead to further structural consequences for the resulting operators. Specifica
קרא במקור המקורי
arxiv.org
פתח כתבה מקורית