Solving Finite Mixture Models: Efficient Computation in Economics Under Serial and Parallel Execution
- 108 Downloads
Many economic models are completed by finding a parameter vector θ that optimizes a function f(θ), a task that can only be accomplished by iterating from a starting vector θ0. Use of a generic iterative optimizer to carry out this task can waste enormous amounts of computation when applied to a class of problems defined here as finite mixture models. The finite mixture class is large and important in economics and eliminating wasted computations requires only limited changes to standard code. Further, the approach described here greatly increases gains from parallel execution and opens possibilities for re-writing objective functions to make further efficiency gains.
Keywordsheterogeneous agent models numerical optimization
Unable to display preview. Download preview PDF.
- Debreu, G. (1983). A social equilibrium existence theorem. In Mathematical Economics: Twenty Papers of Gerard Debreu, Econometric Society Monographs 4, Cambridge University Press.Google Scholar
- Doornik, J.A., Hendry, D.F. and Shephard, N. (2002). Computationally-intensive econometrics using a distributed matrix-programming language. Philosophical Transactions of the Royal Society of London, Series A, 360, 1245–1266.Google Scholar
- Eckstein, Z. and Wolpin, K.I. (1990). Estimating a market equilibrium search model from panel data on individuals. Econometrica, 58(4), 783–808.Google Scholar
- Goldfeld, S.M., Quandt, R.E. and Trotter, H.F. (1966). Maximization by quadratic hill-climbing. Econometrica, 34(3), 541–551.Google Scholar
- Heckman, J.J. and Singer, B. (1984). A method for minimizing the imapct of distributional assumptions in econometric models for duration data. Econometrica, 52Google Scholar
- Hotz, J. and Miller, R.A. (1993). Conditional choice probabilities and the estimation of dynamic models. Reviews of Economic Studies, 60, 497–529.Google Scholar
- Imai, S., Jain, N. and Ching, A. (2002). Bayesian estimation of dynamic discrete choice models. Manuscript, Ohio State, April, http://www.econ.ohiostate.edu/aching/research/bayes2c.pdf.
- Judd, K.L. (1988). Numerical Methods In Economics. MIT Press, Cambridge.Google Scholar
- Nagurney, A. (1996). Parallel computation. In D. Kendrick, J. Rust and H.M. Amman (eds.), Handbook of Computational Economics, 331–400. North-Holland, Amsterdam.Google Scholar
- Press, W.H., Flannery, B.P., Teukolsky, S.A. and Vetterling, W.T. (1987). Numerical Recipes: The Art of Scientific Computing. Cambridge University Press, New York.Google Scholar
- Rios-Rull, V. (1999). Computation of equilibria in heterogenous agent models. In R. Marimon and A. Scott (eds.), Computaional Methods for the Study of Dynamic Economies: An Introduction. Oxford University Press, Oxford.Google Scholar
- Rust, J. (1994). Structure estimation of markov decision processes. In R. Engle and D. McFadden (eds.), Handbook of Econometrics, Vol. 4, 30823139. North Holland, Amsterdam.Google Scholar
- Rust, J. (1996). Numerical dyanmic programming in economics. In H. Amman, D. Kendric and J. Rust (eds.), Handbook of Computational Economics. Elsevier, North Holland.Google Scholar
- Schittkowski, K. (2001). NLPQLP: A new Fortran implementation of a sequential quadratic programming algorithm for parallel computing. Manuscript, http://www.uni-bayreuth.de/departments/math/kschittkowski/nlpqlp_rep.htm.