Results 41 to 50 of about 9,704 (289)

Extensions of semi-Lipschitz functions on quasi-metric spaces

Journal of Numerical Analysis and Approximation Theory, 2001
The aim of this note is to prove an extension theorem for semi-Lipschitz real functions dened on quasi-metric spaces, similar to McShane extension theorem for real-valued Lipschitz functions dened on a metric space ([2], [4]).
Costică Mustăţa
doaj   +2 more sources

“It Is Much Safer to Be Sparse than Connected”: Safe Control of Robotic Swarm Density Dynamics with PDE Optimization with State Constraints

Advanced Intelligent Systems, EarlyView.
This paper proposes a novel control framework to ensure safety of a robotic swarm. A feedback optimization controller is capable of driving the swarm toward a target density while keeping risk‐zone exposure below a safety threshold. Theory and experiments show how safety is more effectively achieved for sparsely connected swarms.
Longchen Niu, Gennaro Notomista
wiley   +1 more source

Lipschitz continuity for isotropic matrix functions

, 2021
We prove a sharp Lipschitz bound for isotropic matrix functions in terms of the Lipschitz constant for the underlying vector ...
Carlsson, Marcus,, Lund University.
core   +2 more sources

JACOBI TRANSFORM OF \((\nu, \gamma, p)\)-JACOBI–LIPSCHITZ FUNCTIONS IN THE SPACE \(\mathrm{L}^{p}(\mathbb{R}^{+},\Delta_{(\alpha,\beta)}(t) dt)\)

Ural Mathematical Journal, 2019
Using a generalized translation operator, we obtain an analog of Younis' theorem [Theorem 5.2, Younis M.S. Fourier transforms of Dini–Lipschitz functions, Int. J. Math. Math. Sci., 1986] for the Jacobi transform for functions from the \((\nu, \gamma, p)\)
Mohamed El Hamma, Hamad Sidi Lafdal, Nisrine Djellab, Chaimaa Khalil   +3 more
doaj   +1 more source

An extension of the quasi-Newton method for minimizing locally Lipschitz functions [PDF]

Iranian Journal of Numerical Analysis and Optimization, 2019
We present a method to minimize locally Lipschitz functions. At first, a local quadratic model is developed to approximate a locally Lipschitz function. This model is constructed by using the ϵ-subdifferential.
Z. Akbari
doaj   +1 more source

Front Propagation Through a Perforated Wall

Communications on Pure and Applied Mathematics, EarlyView.
ABSTRACT We consider a bistable reaction– diffusion equation ut=Δu+f(u)$u_t=\Delta u +f(u)$ on RN${\mathbb {R}}^N$ in the presence of an obstacle K$K$, which is a wall of infinite span with many holes. More precisely, K$K$ is a closed subset of RN${\mathbb {R}}^N$ with smooth boundary such that its projection onto the x1$x_1$‐axis is bounded and that ...
Henri Berestycki, François Hamel, Hiroshi Matano   +2 more
wiley   +1 more source

Lost in Translation? Risk‐Adjusting RMSE for Economic Forecast Performance

Journal of Forecasting, EarlyView.
ABSTRACT When used for parameter optimization and/or model selection, traditional mean squared error (MSE)–based measures of forecast accuracy often exhibit a weak or even negative correlation with the economic value of return forecasts measured by, for example, the Sharpe ratios of the resulting portfolios.
Lukas Salcher, Sebastian Stöckl, Michael Hanke   +2 more
wiley   +1 more source

Extension of Lipschitz functions

, 2016
In this master’s thesis two recent results related to the problem of the extension of Lipschitz functions are presented. The first one deals with functions defined on subsets of metric spaces with values in the real numbers that are both Lipschitz and ...
Oberhammer, Lorenz
core   +2 more sources

Lipschitz Functions on Submanifolds of Heisenberg Groups [PDF]

, 2022
We study the behavior of Lipschitz functions on intrinsic C1 submanifolds of Heisenberg groups: our main result is their almost everywhere tangential Pansu differentiability.
Julia, Antoine, Sebastiano Nicolussi Golo, Davide Vittone, Nicolussi Golo, Sebastiano, Vittone, Davide, Antoine Julia   +5 more
core   +1 more source

A Coarse Geometric Approach to Graph Layout Problems

Journal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang, David Hume, Samuel J. Kelly, Ryan Lam   +3 more
wiley   +1 more source