We develop new characterizations of both global and local error bounds for general functions, using directional derivatives and tangent cones without imposing convexity or linear structure. We first establish several equivalent conditions for the global error bound of a nonnegative lower semicontinuous function. These equivalences hold for general, possibly nonconvex and nonsmooth functions. We further link the error bound with perturbation stability, Hausdorff stability of sublevel sets, and an inverse-sublevel-set estimate. Turning to directional derivatives, we introduce the minimal unit-sphere directional derivative \(\varphi(x)\) on the tangent cone and clarify its exact relation with the global slope. For Lipschitz continuous functions we prove that \(\sup_{x\notin S_0} \varphi(x)<0\) is sufficient for an error bound, and for convex functions on convex sets this condition is also necessary, In finite dimensions we obtain sharp local results: if \(\varphi(\bar{x})>0\) at a solution \(\bar{x}\), then a local error bound holds and the optimal constant is exactly \(1/\varphi(\bar{x})\); if \(\varphi(\bar{x}) = 0\) and a suitable direction exists outside the tangent cone of the solution set, the local error bound fails. A general estimate relating the directional derivative to the distance from the tangent cone of the solution set is also derived.
We establish a general approximations theorem for semiconvex and semiconcave functions with general modulus by using the compensated convex transforms introduced by K. Zhang [Compensated convexity and its applications, Ann. Inst. H. Poincaré (C) Non Linear Analysis 25/4 (2008) 743–771]. For a semiconvex function...
Maryam Salam Alatawi· Journal of Convex Analysis· 0 citations
We explore fast convergence of the Riemannian Frank--Wolfe method for smooth geodesically convex optimization over compact feasible sets. Hadamard manifolds are the main setting. On general complete manifolds, the analysis accounts for all feasible minimizing geodesics. We consider the open loop step-size $\eta_k=a/(k+...
A first-order optimization theory under uniform nondegeneracy that spans geometry, computation, and information is established, and it is shown that this tractability can break down on restricted domains.
We study diffeomorphisms of Banach spaces satisfying generalized hyperbolicity: the stable and unstable subspaces are invariant only up to inclusion, need not depend continuously on the point, and expansivity may fail. On closed manifolds, this condition is equivalent to Axiom~A with strong transversality. We introduce...
We establish fundamental connections between the convexity of a set K in
\mathbb{R}^n
R
n
, its local simplicity, and its reduced boundary in the sense of geometric measure theory. One of the most important results in convex analysis asserts that a closed set with non-empty interior is convex...
David G. Caraballo· Journal of Convex Analysis· 0 citations
We study an inverse optimal-control problem for identifying nonnegative weights in a convex-feature lower-level objective. The resulting model is an optimistic bilevel optimal-control problem whose lower level is a strongly convex, linearly constrained control problem with box constraints in \(L^2\). For the reduced re...
Ji-Guang Yu, L. Wang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.