A new construction of the degree of maximal monotone maps
Mohammad Niksirat

TL;DR
This paper introduces a simplified method for constructing the degree of maximal monotone maps between certain Banach spaces, facilitating easier calculations and classical theorem proofs in convex analysis.
Contribution
It presents a novel, simpler construction of the degree for maximal monotone maps in specific Banach space settings, improving upon classical methods.
Findings
Simplified degree construction for maximal monotone maps
Facilitates easier calculation of degree in nonlinear analysis
Proves classical convex analysis theorems using the new degree
Abstract
The inclusion equations of the type where is a maximal monotone map, are extensively studied in nonlinear analysis. In this paper, we present a new construction of the degree of maximal monotone maps of the form , where is a locally uniformly convex and separable Banach space continuously embedded in the uniformly convex Banach space . The advantage of the new construction lies in the remarkable simplicity it offers for calculation of degree in comparison with the classical one suggested by F. Browder. We prove a few classical theorems in convex analysis through the suggested degree.
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 · Advanced Differential Equations and Dynamical Systems · Advanced Banach Space Theory
