Differentiability of the argmin function and a minimum principle for semiconcave subsolutions
From MaRDI portal
Publication:3303378
zbMath1453.90122arXiv1808.04402MaRDI QIDQ3303378
Julius Ross, David Witt Nyström
Publication date: 11 August 2020
Full work available at URL: https://arxiv.org/abs/1808.04402
Convex programming (90C25) Set-valued set functions and measures; integration of set-valued functions; measurable selections (28B20) Set-valued and function-space-valued mappings on manifolds (58C06)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Dirichlet duality and the nonlinear Dirichlet problem on Riemannian manifolds
- The Dirichlet problem for nonlinear second order elliptic equations. III: Functions of the eigenvalues of the Hessian
- The partial Legendre transformation for plurisubharmonic functions
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Lipschitz continuity of inf-projections
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Calmness and Stability Properties of Marginal and Performance Functions
- Every Convex Function is Locally Lipschitz
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Dirichlet duality and the nonlinear Dirichlet problem
- User’s guide to viscosity solutions of second order partial differential equations
- Generalized Gradients and Applications
- Variational Analysis
- Differentiability Properties of Optimal Value Functions
- Dini Derivatives of the Marginal Function of a Non-Lipschitzian Program
- Extension of Convex Function
- Convex Analysis
This page was built for publication: Differentiability of the argmin function and a minimum principle for semiconcave subsolutions