اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدClarke subgradients of stratifiable functions
94
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We establish the following result: if the graph of a (nonsmooth) real-extended-valued function $f:mathbb{R}^{n}to mathbb{R}cup{+infty}$ is closed and admits a Whitney stratification, then the norm of the gradient of $f$ at $xin{dom}f$ relative to the stratum containing $x$ bounds from below all norms of Clarke subgradients of $f$ at $x$. As a consequence, we obtain some Morse-Sard type theorems as well as a nonsmooth Kurdyka-L ojasiewicz inequality for functions definable in an arbitrary o-minimal structure.
قيم البحث
اقرأ أيضاً
Using a geometric argument, we show that under a reasonable continuity condition, the Clarke subdifferential of a semi-algebraic (or more generally stratifiable) directionally Lipschitzian function admits a simple form: the normal cone to the domain
and limits of gradients generate the entire Clarke subdifferential. The characterization formula we obtain unifies various apparently disparate results that have appeared in the literature. Our techniques also yield a simplified proof that closed semialgebraic functions on $R^n$ have a limiting subdifferential graph of uniform local dimension $n$.
We introduce and study (metrically) quarter-stratifiable spaces and then apply them to generalize Rudin and Kuratowski-Montgomery theorems about the Baire and Borel complexity of separately continuous functions.
We provide a characterization of the set of real-valued functions that can be the value function of some polynomial game. Specifically, we prove that a function $u : dR to dR$ is the value function of some polynomial game if and only if $u$ is a continuous piecewise rational function.
We discuss the possibility to represent smooth nonnegative matrix-valued functions as finite linear combinations of fixed matrices with positive real-valued coefficients whose square roots are Lipschitz continuous. This issue is reduced to a similar
problem for smooth functions with values in a polyhedron.
A novel derivative-free algorithm, optimization by moving ridge functions (OMoRF), for unconstrained and bound-constrained optimization is presented. This algorithm couples trust region methodologies with output-based dimension reduction to accelerat
e convergence of model-based optimization strategies. The dimension-reducing subspace is updated as the trust region moves through the function domain, allowing OMoRF to be applied to functions with no known global low-dimensional structure. Furthermore, its low computational requirement allows it to make rapid progress when optimizing high-dimensional functions. Its performance is examined on a set of test problems of moderate to high dimension and a high-dimensional design optimization problem. The results show that OMoRF compares favourably to other common derivative-free optimization methods, even for functions in which no underlying global low-dimensional structure is known.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
