Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Rate of convergence

Known as: R-linear, Q-linear, Speed of convergence 
In numerical analysis, the speed at which a convergent sequence approaches its limit is called the rate of convergence. Although strictly speaking, a… Expand
Wikipedia

Related topics

Related topics

37 relations
Aitken's delta-squared processBisection methodBrent's methodCMA-ES
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
A Tutorial on Bayesian Optimization
Bayesian optimization is an approach to optimizing objective functions that take a long time (minutes or hours) to evaluate. It… Expand
  • figure 1
  • figure 2
  • figure 3
Review
2018
Review
2018
An Overview of Recent Advances in Fixed-Time Cooperative Control of Multiagent Systems
Fixed-time cooperative control is currently a hot research topic in multiagent systems since it can provide a guaranteed settling… Expand
Highly Cited
2012
Highly Cited
2012
On the O(1/n) Convergence Rate of the Douglas-Rachford Alternating Direction Method
Alternating direction methods (ADMs) have been well studied in the literature, and they have found many efficient applications in… Expand
Highly Cited
2012
Highly Cited
2012
A Stochastic Gradient Method with an Exponential Convergence Rate for Finite Training Sets
We propose a new stochastic gradient method for optimizing the sum of a finite set of smooth functions, where the sum is strongly… Expand
  • figure 1
  • figure 2
Highly Cited
2011
Highly Cited
2011
Convergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization
We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal… Expand
  • figure 1
  • figure 2
Highly Cited
2011
Highly Cited
2011
Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
We present a new family of subgradient methods that dynamically incorporate knowledge of the geometry of the data observed in… Expand
Highly Cited
2009
Highly Cited
2009
Cuckoo Search via Lévy flights
  • Xin-She Yang, S. Deb
  • World Congress on Nature & Biologically Inspired…
  • 2009
    • Corpus ID: 206491725
In this paper, we intend to formulate a new meta-heuristic algorithm, called Cuckoo Search (CS), for solving optimization… Expand
  • figure 1
  • figure 3
  • figure 2
  • table 1
  • table 2
Highly Cited
2001
Highly Cited
2001
ON CONVEX SOBOLEV INEQUALITIES AND THE RATE OF CONVERGENCE TO EQUILIBRIUM FOR FOKKER-PLANCK TYPE EQUATIONS
It is well known that the analysis of the large-time asymptotics of Fokker-Planck type equations by the entropy method is closely… Expand
Highly Cited
1997
Highly Cited
1997
GPS measurements of present-day convergence across the Nepal Himalaya
The high elevations of the Himalaya and Tibet result from the continuing collision between India and Asia, which started more… Expand
Highly Cited
1986
Highly Cited
1986
Convergence of an annealing algorithm
The annealing algorithm is a stochastic optimization method which has attracted attention because of its success with certain… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE