Cover_IWH-Discussion-Papers_2016.jpg

An Evolutionary Algorithm for the Estimation of Threshold Vector Error Correction Models

We develop an evolutionary algorithm to estimate Threshold Vector Error Correction models (TVECM) with more than two cointegrated variables. Since disregarding a threshold in cointegration models renders standard approaches to the estimation of the cointegration vectors inefficient, TVECM necessitate a simultaneous estimation of the cointegration vector(s) and the threshold. As far as two cointegrated variables are considered this is commonly achieved by a grid search. However, grid search quickly becomes computationally unfeasible if more than two variables are cointegrated. Therefore, the likelihood function has to be maximized using heuristic approaches. Depending on the precise problem structure the evolutionary approach developed in the present paper for this purpose saves 90 to 99 per cent of the computation time of a grid search.

18. Februar 2010

Autoren Makram El-Shagi

Empfohlene Publikationen

cover_international-economics-and-economic-policy.jpg

An Evolutionary Algorithm for the Estimation of Threshold Vector Error Correction Models

Makram El-Shagi

in: International Economics and Economic Policy, Nr. 4, 2011

Abstract

We develop an evolutionary algorithm to estimate Threshold Vector Error Correction models (TVECM) with more than two cointegrated variables. Since disregarding a threshold in cointegration models renders standard approaches to the estimation of the cointegration vectors inefficient, TVECM necessitate a simultaneous estimation of the cointegration vector(s) and the threshold. As far as two cointegrated variables are considered, this is commonly achieved by a grid search. However, grid search quickly becomes computationally unfeasible if more than two variables are cointegrated. Therefore, the likelihood function has to be maximized using heuristic approaches. Depending on the precise problem structure the evolutionary approach developed in the present paper for this purpose saves 90 to 99 per cent of the computation time of a grid search.

Publikation lesen

Ihr Kontakt

Für Journalistinnen/en

Mitglied der Leibniz-Gemeinschaft LogoTotal-Equality-LogoGefördert durch das BMWK