نتایج جستجو برای: non lipschitz condition
تعداد نتایج: 1593088 فیلتر نتایج به سال:
Abstract. We consider functions f(A,B) of noncommuting self-adjoint operators A and B that can be defined in terms of double operator integrals. We prove that if f belongs to the Besov class B ∞,1 (R), then we have the following Lipschitz type estimate in the trace norm: ‖f(A1, B1)− f(A2, B2)‖S1 ≤ const(‖A1 −A2‖S1 + ‖B1 −B2‖S1). However, the condition f ∈ B ∞,1 (R) does not imply the Lipschitz ...
The paper provides a condition for differentiability as well as an equivalent criterion for Lipschitz continuity of singular normal distributions. Such distributions are of interest, for instance, in stochastic optimization problems with probabilistic constraints, where a comparatively small (nondegenerate-) normally distributed random vector induces a large number of linear inequality constrai...
Based on A-stable one-leg methods and linear interpolations, we introduce four algorithms for solving neutral differential equations with variable delay. A natural question is which algorithm is better. To answer this question, we analyse the error behavior of the four algorithms and obtain their error bounds under a one-sided Lipschitz condition and some classical Lipschitz conditions. After e...
Global finite-time observers are designed for a class of nonlinear systems that are uniformly observable and possibly non-Lipschitz. The non-Lipschitz conditions under which global finite-time observers exist are in terms of bounds of the varying rational powers of the increments of the non-Lipschitz nonlinearities. These are the same conditions under which semi-global finite-time observers wer...
We characterize the local single-valuedness and continuity of multifunctions (set-valued mappings) in terms of their submonotonicity and lower semicontinuity. This result completes the well-known condition that lower semicontinuous, monotone multifunctions are single-valued and continuous. We also show that a multifunction is actually a Lipschitz single-valued mapping if and only if it is submo...
this contribution mainly focuses on some aspects of lipschitz groups, i.e., metrizable groups with lipschitz multiplication and inversion map. in the main result it is proved that metric groups, with a translation-invariant metric, may be characterized as particular group objects in the category of metric spaces and lipschitz maps. moreover, up to an adjustment of the metric, a...
Abstract We consider the problem of computing maximal invariant set discrete-time linear systems subject to a class non-convex constraints that admit quadratic relaxations. These include semialgebraic sets and other smooth with Lipschitz gradient. With these relaxations, sufficient condition for invariance is derived it can be formulated as matrix inequalities. Based on condition, new algorithm...
Let $(X,d)$ be an infinite compact metric space, let $(B,parallel . parallel)$ be a unital Banach space, and take $alpha in (0,1).$ In this work, at first we define the big and little $alpha$-Lipschitz vector-valued (B-valued) operator algebras, and consider the little $alpha$-lipschitz $B$-valued operator algebra, $lip_{alpha}(X,B)$. Then we characterize its second dual space.
Abstract In this article, we study a class of pseudomonotone split variational inequality problems (VIPs) with non-Lipschitz operator. We propose new inertial extragradient method self-adaptive step sizes for finding the solution to aforementioned problem in framework Hilbert spaces. Moreover, prove strong convergence result proposed algorithm without prior knowledge operator norm and under mil...
Let E be a closed set in R, and suppose that there is a k ≥ 1 such that every x, y ∈ E can be connected by a rectifiable path in E with length ≤ k |x−y|. This condition is satisfied by chord-arc curves, Lipschitz manifolds of any dimension, and fractals like Sierpinski gaskets and carpets. Note that length-minimizing paths in E are chord-arc curves with constant k. A basic feature of this condi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید