Results 11 to 20 of about 33,661 (311)

Global Asymptotic Convergent Observer for SLAM

open access: yesIEEE Access, 2022
This paper investigates the global convergence problem of SLAM algorithms, a problem that has been subject to topological obstacles. This is due to the fact that state-space of attitude kinematics, $SO(3)$ , is a non-contractible manifold. Hence, $SO(3)
Seyed Hamed Hashemi, Jouni Mattila
doaj   +5 more sources

Relation Between Asymptotic $L_p$-Convergence and Some Classical Modes of Convergence

open access: yesReal Analysis Exchange
Asymptotic $L_p$-convergence, which resembles convergence in $L_p$, was introduced to address a question in diffusive relaxation. This note aims to compare asymptotic $L_p$-convergence with convergence in measure and in weak $L_p$ spaces. One of the results characterizes convergence in measure on finite measure spaces in terms of asymptotic $L_p ...
Alves, Nuno J., Oniani, Giorgi G.
exaly   +5 more sources

On asymptotic convergence rate of random search

open access: yesJournal of Global Optimization, 2023
AbstractThis paper presents general theoretical studies on asymptotic convergence rate (ACR) for finite dimensional optimization. Given the continuous problem function and discrete time stochastic optimization process, the ACR is the optimal constant for control of the asymptotic behaviour of the expected approximation errors. Under general assumptions,
Tarłowski, Dawid
openaire   +5 more sources

Statistical convergence in vector lattices [PDF]

open access: yesҚарағанды университетінің хабаршысы. Математика сериясы, 2023
The statistical convergence is defined for sequences with the asymptotic density on the natural numbers, in general. In this paper, we introduce the statistical convergence in vector lattices by using the finite additive measures on directed sets ...
A. Aydın, F. Temizsu
doaj   +2 more sources

On the Asymptotic Convergence and Acceleration of Gradient Methods [PDF]

open access: yesJournal of Scientific Computing, 2021
We consider the asymptotic behavior of a family of gradient methods, which include the steepest descent and minimal gradient methods as special instances. It is proved that each method in the family will asymptotically zigzag between two directions. Asymptotic convergence results of the objective value, gradient norm, and stepsize are presented as well.
Yakui Huang   +3 more
openaire   +2 more sources

Regularized Asymptotic Solutions of a Singularly Perturbed Fredholm Equation with a Rapidly Varying Kernel and a Rapidly Oscillating Inhomogeneity

open access: yesAxioms, 2022
This article investigates an equation with a rapidly oscillating inhomogeneity and with a rapidly decreasing kernel of an integral operator of Fredholm type.
Dana Bibulova   +2 more
doaj   +1 more source

Generalization of the Regularization Method to Singularly Perturbed Integro-Differential Systems of Equations with Rapidly Oscillating Inhomogeneity

open access: yesAxioms, 2021
In this paper, we consider systems of singularly perturbed integro-differential equations with a rapidly oscillating right-hand side, including an integral operator with a slowly varying kernel.
Abdukhafiz Bobodzhanov   +2 more
doaj   +1 more source

Internal boundary layer in a singularly perturbed problem of fractional derivative

open access: yesҚарағанды университетінің хабаршысы. Математика сериясы, 2020
This paper is devoted to the study of internal boundary layer. Such motions are often associated with effect of boundary layer, i.e. low flow viscosity affects only in a narrow parietal layer of a streamlined body, and outside this zone the flow is as ...
B.T. Kalimbetov   +2 more
doaj   +1 more source

Asymptotic convergence rates for averaging strategies [PDF]

open access: yesProceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2021
Parallel black box optimization consists in estimating the optimum of a function using $λ$ parallel evaluations of $f$. Averaging the $μ$ best individuals among the $λ$ evaluations is known to provide better estimates of the optimum of a function than just picking up the best.
Laurent Meunier   +3 more
openaire   +2 more sources

Asymptotic Convergence of Thompson Sampling

open access: yesCoRR, 2020
Thompson sampling has been shown to be an effective policy across a variety of online learning tasks. Many works have analyzed the finite time performance of Thompson sampling, and proved that it achieves a sub-linear regret under a broad range of probabilistic settings. However its asymptotic behavior remains mostly underexplored.
Cem Kalkanli, Ayfer Özgür
openaire   +2 more sources

Home - About - Disclaimer - Privacy