Results 171 to 180 of about 10,513 (300)

Lipschitz functions and convolution

Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1974
openaire   +3 more sources

Approximation of continuous functions by Lipschitz functions

, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the Choice of Optimization Norm for Anderson Acceleration of the Picard Iteration for Navier–Stokes Equations

Numerical Methods for Partial Differential Equations, Volume 42, Issue 4, July 2026.
ABSTRACT While recent Anderson acceleration (AA) convergence theory [Pollock et al., IMA Num. An., 2021] requires that the AA optimization norm match the Hilbert space norm associated with the fixed point operator, in implementations the ℓ2$$ {\ell}^2 $$ norm is the most common choice. So far there is little research done regarding this discrepancy. To
Elizabeth Hawkins, Leo G. Rebholz
wiley   +1 more source

Structure-aware state space modeling with multi-scale feature fusion for railway scene segmentation. [PDF]

Sci Rep
Fu H, Ma Z, Yang X, Zhang W, Hu L, Jiang K.   +5 more
europepmc   +1 more source

Is the maximal function of a Lipschitz function continuous?

, 1999
We examine the action of the maximal operator \(M\) on Lipschitz and Hölder functions in the context of homogeneous spaces. It is shown that in spaces satisfying a so-called annular decay property, \(M\) maps spaces of Hölder type to other spaces of Hölder type (the Hölder index is preserved if small enough).
openaire   +3 more sources

Geometric Planted Matchings Beyond the Gaussian Model

Random Structures &Algorithms, Volume 68, Issue 4, July 2026.
ABSTRACT We consider the problem of recovering an unknown matching between a set of n$$ n $$ randomly placed points in ℝd$$ {\mathbb{R}}^d $$ and random perturbations of these points. This can be seen as a model for particle tracking and more generally, entity resolution.
Lucas R. Schwengber, Roberto I. Oliveira
wiley   +1 more source

Generalization bounds for a generator-regularized InfoGAN-inspired adversarial objective. [PDF]

Front Artif Intell
Hasan M, Muia MN, Islam MM.
europepmc   +1 more source

F-Lipschitz Optimization

, 2010
In wireless sensors networks it is common that decision variables must be optimized by algorithms that need tobe fast, simple, and robust to errors and noises, both in a centralized and in a distributed set-up.
Fischione, Carlo,
core  

Maximum Induced Trees and Forests of Bounded Degree in Random Graphs

Random Structures &Algorithms, Volume 68, Issue 4, July 2026.
ABSTRACT The asymptotic behavior of the maximum sizes of induced trees and forests has been studied extensively in the last few decades, though the overall picture is far from being complete. In this paper, we close several significant gaps: (1) We prove 2‐point concentration of the maximum sizes of an induced forest and an induced tree with maximum ...
Margarita Akhmejanova, Vladislav Kozhevnikov, Maksim Zhukovskii   +2 more
wiley   +1 more source

EMP: Enhanced Multi-modal Prediction for fashion sales using Fourier Mapping and ERP-based contrastive learning. [PDF]

PLoS One
Park S, Park B, Lee S, Shin S, Kim W.
europepmc   +1 more source