Nonmaximal sums of maximally monotone operators under Rockafellar's constraint qualification
Paper recorded by Signals 4 on 2026-09-09 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-09 on arXiv · recorded by Signals 4 on 2026-09-10
Category: cs.LG · 机器学习 · first seen 2026-09-10
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. We give one counterexample on $c_0$ and another on $\ell^1$ with its usual norm. We establish a general construction theorem that computes the entire monotone polar of a class of graphs, gives a necessary and sufficien
Read on arXiv →
Cite this page: Nonmaximal sums of maximally monotone operators under Rockafellar's constraint qualification: the #86 most recent of 215 cs.LG papers we have recorded (as of 2026-09-09). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/nonmaximal-sums-of-maximally-monotone-operators-under-rockafellar-s-constraint-q.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable:
papers.json
Get 4 AI signals a day by email — free.
Get 4 AI signals a day by email — free