Subgradients of Minimal Time Functions Under Minimal Requirements

From MaRDI portal
Publication:3107285

zbMATH Open1248.49020arXiv1009.1585MaRDI QIDQ3107285FDOQ3107285


Authors: Boris S. Mordukhovich, Nguyen Mau Nam Edit this on Wikidata


Publication date: 23 December 2011

Abstract: This paper concerns the study of a broad class of minimal time functions corresponding to control problems with constant convex dynamics and closed target sets in arbitrary Banach spaces. In contrast to other publications, we do not impose any nonempty interior and/or calmness assumptions on the initial data and deal with generally non-Lipschitzian minimal time functions. The major results present refined formulas for computing various subgradients of minimal time functions under minimal requirements in both cases of convex and nonconvex targets. Our technique is based on advanced tools of variational analysis and generalized differentiation.


Full work available at URL: https://arxiv.org/abs/1009.1585




Recommendations





Cited In (25)





This page was built for publication: Subgradients of Minimal Time Functions Under Minimal Requirements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107285)