A Unit Root Test With Markov Switching Deterministic Components: A Special Emphasis on Nonlinear Optimization Algorithms

Abstract

In this study, we investigate the performance of different optimization algorithms in estimating the Markov switching (MS) deterministic components of the traditional ADF test. For this purpose, we consider Broyden, Fletcher, Goldfarb, and Shanno (BFGS), Berndt, Hall, Hall, Hausman (BHHH), Simplex, Genetic, and Expectation-Maximization (EM) algorithms. The simulation studies show that the Simplex method has significant advantages over the other commonly used hill-climbing methods and EM. It gives unbiased estimates of the MS deterministic components of the ADF unit root test and delivers good size and power properties. When Hamilton's (Econometrica 57:357-384, 1989) MS model is re-evaluated in conjunction with the alternative algorithms, we furthermore show that Simplex converges to the global optima in stationary MS models with remarkably high precision and even when convergence criterion is raised, or initial values are altered. These advantages of the Simplex routine in MS models allow us to contribute to the current literature. First, we produce the exact critical values of the generalized ADF unit root test with MS breaks in trends. Second, we derive the asymptotic distribution of this test and provide its invariance feature.