Differentiability of the argmin function and a minimum principle for semiconcave subsolutions
Julius Ross, David Witt Nystr\"om

TL;DR
This paper proves the almost everywhere differentiability of the argmin function under certain convexity conditions and applies this to establish a minimum principle for specific semiconcave subsolutions.
Contribution
It introduces a differentiability result for the argmin function in a convex setting and derives a new minimum principle for semiconcave subsolutions.
Findings
Argmin function is differentiable almost everywhere.
Established a minimum principle for semiconcave subsolutions.
Provides theoretical foundation for optimization and analysis of subsolutions.
Abstract
Suppose is convex where , and the argmin function exists and is single valued. We will prove is differentiable almost everywhere. As an application we deduce a minimum principle for certain semiconcave subsolutions.
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
TopicsNonlinear Partial Differential Equations · Optimization and Variational Analysis · Advanced Differential Equations and Dynamical Systems
