This paper examines maximum likelihood estimation via hill climbing and the expectations maximization (EM) algorithm in the context of Hamilton's Markov switching framework. The techniques are explained in detail and are followed by a discussion of both analytic and computational issues. Both algorithms tend to be computer intensive, but an approximation technique is shown to significantly reduce the computational demands of the EM algorithm relative to a Davidon Fletcher Powell hill-climbing routine.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by Rutgers University, Department of Economics in its series Departmental Working Papers with number
199817.