Convergence rate of inertial Forward–Backward algorithm beyond Nesterov’s rule
نویسندگان
چکیده
منابع مشابه
Exact Rate of Convergence of Kernel-Based Classification Rule
A binary classification problem is considered, where the posteriori probability is estimated by the nonparametric kernel regression estimate with naive kernel. The excess error probability of the corresponding plug-in decision classification rule according to the error probability of the Bayes decision is studied such that the excess error probability is decomposed into approximation and estima...
متن کاملConvergence Rate of the Fuzzy Generalized Nearest Neighbor Rule
tizzy k nearest neighbor rule (k-NNR) has been applied in a variety of substantive areas. Yang and Chen [l] described a fuzzy generalized k-NN algorithm which is a unified approach to a variety of fuzzy k-NNR’s. They created the strong consistency of posterior risk of the fuzzy generalized NNR. In this paper, we give their convergence rate. That is, the convergence rate of posterior risk of the...
متن کاملConvergence on the Sphere Model – Progress Rate and Beyond
From 05.02.06 to 10.02.06, the Dagstuhl Seminar 06061 “Theory of Evolutionary Algorithms” was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar result...
متن کاملImprovement of the rate of convergence estimates for multigrid algorithm
In this paper, we present a new convergence rate for both symmetric and nonsymmetric positive definite problems. In our theory, ‘‘regularity and approximation’’ assumption is used. A new rate of convergence estimate with a 1⁄4 1 2 is used where a is a ‘‘regularity and approximation’’ parameter. Also, a new convergence rate is given by two-grid schemes. 2006 Elsevier Inc. All rights reserved.
متن کاملThe Rate of Convergence of the Walk on Spheres Algorithm
In this paper we examine the rate of convergence of one of the standard algorithms for emulating exit probabilities of Brownian motion, the Walk on Spheres (WoS) algorithm. We obtain a complete characterization of the rate of convergence of WoS in terms of the local geometry of a domain.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2018
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-018-1350-9