Concept Architecture
Concept
Theoretically, Convergence is the property whereby a sequence, iterative procedure, estimator or numerical approximation approaches a stable limiting value as the number of iterations, observations or computational steps increases. The concept is central to numerical analysis, optimisation, simulation and statistical estimation because it determines whether a computational or inferential procedure produces a meaningful and reproducible result. In health economics, convergence is essential when estimating model parameters, calibrating decision models, solving optimisation problems and analysing stochastic simulations.
Mathematically, convergence is represented by a limit. A sequence {x?} converges to L when the distance between x? and L becomes arbitrarily small as n increases. In iterative algorithms, convergence is assessed by examining successive parameter estimates, objective-function values or residuals against a predefined tolerance. Different forms include pointwise convergence, convergence in probability, almost-sure convergence and convergence in distribution.
In practice, convergence is evaluated using stopping criteria such as changes in parameter estimates, log-likelihood values, objective functions or simulated outcomes. Health economic analysts routinely assess convergence in probabilistic sensitivity analysis, Bayesian estimation, Markov chain Monte Carlo simulation, model calibration and numerical optimisation to ensure that reported costs, effects and decision statistics are stable.
Purpose
Used to determine whether an iterative, statistical or simulation-based procedure has reached a stable solution that is sufficiently accurate for interpretation and decision-making.
Mathematical Formulae
Primary Formula
lim??� x? = L
Supporting Formulae
�-convergence criterion:
|x? ? L| < �
Successive-iteration criterion:
|x??? ? x?| < �
Relative convergence criterion:
|x??? ? x?| / max(1, |x?|) < �
Objective-function criterion:
|f(x???) ? f(x?)| < �
Monte Carlo standard error:
MCSE = s / �n
Related Mathematical Methods
- Fixed-Point Iteration
- Numerical Optimisation
- Maximum Likelihood Estimation
- Markov Chain Monte Carlo
- Monte Carlo Simulation
- Model Calibration
- Root-Finding Methods
Example
A health economic model is calibrated to observed five-year survival by iteratively updating a transition probability.
Iteration 24:
p?? = 0.08314
Iteration 25:
p?? = 0.08311
Convergence tolerance:
� = 0.0001
Absolute change:
|0.08311 ? 0.08314| = 0.00003
Because 0.00003 < 0.0001, the calibration algorithm satisfies the convergence criterion and terminates.
Excel Implementation
| Function | Example Formula | Health Economics Application |
|---|---|---|
| ABS | =ABS(B3-B2) | Calculate the change between successive iterations |
| IF | =IF(ABS(B3-B2)<$F$1,"Converged","Continue") | Apply a predefined convergence tolerance |
| MAX | =MAX(1,ABS(B2)) | Scale a relative convergence criterion |
| SQRT | =STDEV.S(C2:C1001)/SQRT(COUNT(C2:C1001)) | Calculate Monte Carlo standard error |
| Solver | Minimise calibration error subject to parameter constraints | Estimate model parameters until the optimisation procedure converges |
VBA (Optional)
A VBA procedure can repeat model calculations until parameter changes or objective-function differences fall below a specified convergence tolerance.
Sources
- Burden RL, Faires JD. Numerical Analysis.
- Robert CP, Casella G. Monte Carlo Statistical Methods.
- Gelman A, Carlin JB, Stern HS, Dunson DB, Vehtari A, Rubin DB. Bayesian Data Analysis.
- Briggs A, Claxton K, Sculpher M. Decision Modelling for Health Economic Evaluation.
- ISPOR-SMDM Modeling Good Research Practices Task Force Reports.
Related Concepts (7)
Library
Tools & Resources
1
SAVI — Sheffield Accelerated Value of Information — Mark Strong, Jeremy Oakley & Penny Breeze (University of Sheffield), Web application ed., 2024 (University of Sheffield)
A free, open-access web calculator that computes value-of-information measures (EVPI, partial EVPI/EVPPI and EVSI) directly from a model’s probabilistic sensitivity analysis output — no need to re-run the model. Also reports payer strategy-specific and uncertainty burden.
Web Tool (R Shiny)View source →
Frequently Asked Questions (6)
What is convergence?
The property of an iterative process, such as a Markov chain Monte Carlo run, settling into a stable pattern reflecting the target distribution.
Source: Gelman & Rubin 1992
Why does a simulation need to reach convergence before its output is used?
An iterative simulation such as a Markov chain Monte Carlo run begins from an arbitrary starting point and only gradually settles into producing values that represent the target distribution. Convergence is that settled state, and output taken before it is reached reflects the starting point rather than the answer sought. Using such early, unconverged output biases the result, which is why the run must be shown to have converged before its samples are trusted. Reaching convergence is a precondition for a valid estimate. Gelman and colleagues (2013) describe this.
Source: Gelman et al. 2013
How is convergence of a Markov chain assessed?
Convergence of a Markov chain is assessed by diagnostics that check whether the chain has settled into sampling from the target distribution, such as running several chains from different starting points and comparing the variance within and between them, as in the Gelman-Rubin diagnostic, which should approach a value indicating agreement. Trace plots are inspected for stability, and the discarded initial burn-in is judged. These checks give evidence, though not proof, that the chain has converged and its later draws represent the target distribution.
Source: Gelman & Rubin 1992
Why does convergence matter in simulation?
Convergence matters because the validity of results from an iterative process depends on it: a Markov chain that has not converged is not yet sampling from the target distribution, so its draws give biased estimates, and an optimisation that has not converged has not reached the solution. Relying on unconverged output can mislead. Checking convergence therefore protects against drawing conclusions from a process that has not stabilised, which is why convergence diagnostics accompany Markov chain Monte Carlo and iterative numerical methods.
Source: Gelfand & Smith 1990
What is the difference between convergence and burn-in?
Burn-in is the initial portion of a Markov chain run, from the starting point until the chain reaches the target distribution, which is discarded because it does not represent that distribution, whereas convergence is the property of having reached that stable, target-sampling state. Burn-in is removed so that only post-convergence draws are used for inference. So convergence is the condition the chain attains, and burn-in is the early, pre-convergence stretch set aside; assessing convergence guides how much burn-in to discard.
Source: Gelman & Rubin 1992
What are the limitations of convergence diagnostics?
Convergence diagnostics can indicate a lack of convergence but cannot prove convergence has occurred, since a chain may appear stable yet have failed to explore the whole target distribution, for instance if it is stuck in one region of a multimodal distribution. Different diagnostics can disagree, and passing them is necessary but not sufficient. These limitations mean convergence is assessed with several checks and judgement, treating diagnostics as evidence rather than guarantees that the chain represents the target distribution.
Source: Gelman & Rubin 1992
Trust Record
Verified by Dr Darrin Baines
British health economist
Professional identity: darrinbaines.org
Verification date: 27 Oct 2025
Content version: 1.0.0
Canonical Identity
- Persistent URI
- https://healtheconomics.wiki/concept/convergence
- Term code
- HE-EM-UA-014
Stable URI · Machine-readable · Resolvable · CC BY 4.0