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
Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization
In decentralized optimization, nodes cooperate to minimize an overall objective function that is the sum (or average) of per-node… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Review
2017
Review
2017
A tutorial on kernel density estimation and recent advances
ABSTRACT This tutorial provides a gentle introduction to kernel density estimation (KDE) and recent advances regarding confidence… Expand
Is this relevant?
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
Is this relevant?
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
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The particle swarm optimization algorithm: convergence analysis and parameter selection
The particle swarm optimization algorithm is analyzed using standard results from the dynamic system theory. Graphical parameter… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
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
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Reopening the convergence debate: A new look at cross-country growth empirics
There are two sources of inconsistency in existing cross-country empirical work on growth: correlated individual effects and… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Convergence of an annealing algorithm
The annealing algorithm is a stochastic optimization method which has attracted attention because of its success with certain… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A method for solving the convex programming problem with convergence rate O(1/k^2)
 
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A method for unconstrained convex minimization problem with the rate of convergence o(1/k^2)
 
Is this relevant?
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