Rockafellar's Sum Theorem
Maria Elena Verona, Andrei Verona
TL;DR
This paper revises the proof of Rockafellar's Sum Theorem by eliminating the need for the boundedness condition, simplifying the theoretical framework involved.
Contribution
It introduces a new approach to prove the theorem without relying on the boundedness assumption, enhancing its applicability.
Findings
Boundedness condition can be removed from the proof.
Simplified proof of Rockafellar's Sum Theorem.
Broader applicability of the theorem.
Abstract
We show how to remove the boundedness condition from Eberhard-Wenczel proof of the Rockafellar's Sum Theorem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Functional Equations Stability Results · Advanced Optimization Algorithms Research