Results 21 to 30 of about 173,711,968 (308)
Convergence Rates of Subseries [PDF]
The American Mathematical Monthly, 2019 Let $(x_n)$ be a positive real sequence decreasing to $0$ such that the series $\sum_n x_n$ is divergent and $\liminf_{n} x_{n+1}/x_n>1/2$. We show that there exists a constant $θ\in (0,1)$ such that, for each $\ell>0$, there is a subsequence $(x_{n_k})$ for which $\sum_k x_{n_k}=\ell$ and $x_{n_k}=O(θ^k)$.
openaire +3 more sources
Rate of Convergence for Ibragimov-Gadjiev-Durrmeyer Operators
Demonstratio Mathematica, 2017 The present paper deals with the rate of convergence of the general class of Durrmeyer operators, which are generalization of Ibragimov-Gadjiev operators. The special cases of the operators include somewell known operators as particular cases viz.
Acar Tuncer
doaj +1 more source
Geometrizing Rates of Convergence, III
The Annals of Statistics, 1991 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Donoho, David L., Liu, Richard C.
openaire +3 more sources
Convergence Rates for Projective Splitting [PDF]
SIAM Journal on Optimization, 2019 This version adds references to the extragradient ...
Patrick R. Johnstone, Jonathan Eckstein
openaire +4 more sources
On the rate of convergence of degenerate U-statistics
Lietuvos Matematikos Rinkinys, 2005 Let X, X1, X2, ... be independent identically distributed random variables taking values in a measurable space (Ω, ℜ). Let h(x, y) be real valued measurable symmetric function of the arguments x, y ∈ ℜ. Assume that Eh(x, X)= 0, for all x.
Olga Januškevičienė
doaj +3 more sources
On The Complete Convergence Of Randomly Weighted Sums Of Random Fields
Demonstratio Mathematica, 2014 Let {Xn̲, n̲ ∊ V ⊆ℕd } be a d-dimensional random field indexed by some subset V of lattice ℕd, which are stochastically dominated by a random variable X.
Gdula Agnieszka M., Krajka Andrzej
doaj +1 more source
Rate of Convergence of the Bundle Method [PDF]
Journal of Optimization Theory and Applications, 2017 We prove that the bundle method for nonsmooth optimization achieves solution accuracy $\varepsilon$ in at most $\mathcal{O}\big(\ln(1/\varepsilon)/\varepsilon\big)$ iterations, if the function is strongly convex. The result is true for the versions of the method with multiple cuts and with cut aggregation.
Yu Du 0003, Andrzej Ruszczynski
openaire +4 more sources
On the rate of convergence to Rosenblatt-type distribution [PDF]
, 2015 The main result of the article is the rate of convergence to the Rosenblatt-type distributions in non-central limit theorems. Specifications of the main theorem are discussed for several scenarios.
Anh, Vo +3 more
core +2 more sources
Cumhuriyet Science Journal, 2021 In the present paper, we introduce a new kind of convergence, called the statistical relative uniform convergence, for a double sequence of functions at a point, where the relative uniform convergence of the set of the neighborhoods of the given point is
Sevda Yıldız
doaj +1 more source
Convergence Rates for Markov Chains [PDF]
SIAM Review, 1995 Summary: This is an expository paper that presents various ideas related to nonasymptotic rates of convergence for Markov chains. Such rates are of great importance for stochastic algorithms that are widely used in statistics and in computer science. They also have applications to analysis of card shuffling and other areas.
openaire +2 more sources