Maximal monotonicity of the subdifferential of a convex function: a direct proof
Milen Ivanov, Nadia Zlateva
TL;DR
This paper presents a new, direct proof demonstrating that the subdifferential of a convex function is maximally monotone, simplifying the understanding of this fundamental property in convex analysis.
Contribution
It offers a novel, straightforward proof of maximal monotonicity for subdifferentials, enhancing theoretical clarity in convex analysis.
Findings
New direct proof of maximal monotonicity
Simplifies understanding of subdifferential properties
Strengthens theoretical foundations in convex analysis
Abstract
We provide a new proof for maximal monotonicity of the subdifferential of a convex function.
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
TopicsMathematical Inequalities and Applications · Optimization and Variational Analysis · Advanced Optimization Algorithms Research