Max-plack-institut fiir mathematik
In this paper, the author computes bounds on the entropy dimension of the set of generalized critical values for certain classes of locally Lipschitz functions (continuous selections, componentwise maximum functions of \(C^k\)-mappings). This yields a measure of metric complexity to compare these classes. For vector valued functions the concepts of derivative are compared from such metric point of view. For continuous selections of differentiable functions, explicit bounds on the \(\varepsilon\)-entropy of the nearly critical values of \(f\) are provided.
- On the \(\varepsilon\)-entropy of nearly critical values
- Tame geometry with application in smooth analysis
- Semialgebraic complexity of functions
- Sard theorems for Lipschitz functions and applications in optimization
- A Sard theorem for tame set-valued mappings
- scientific article; zbMATH DE number 4028452 (Why is no real title available?)
- Critical Values and Representation of Functions by Means of Compositions
- Lidskii's Theorem via Nonsmooth Analysis
- scientific article; zbMATH DE number 865587 (Why is no real title available?)
- scientific article; zbMATH DE number 5228061 (Why is no real title available?)
- On the Hadamard formula for nonsmooth domains
This page was built for publication: Max-plack-institut fiir mathematik
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385273)