Solving Finite Mixture Models in Parallel
Christopher Ferrall ()
Computational Economics from EconWPA
Many economic models are completed by finding a parameter vector that optimizes a function f, a task that only be accomplished by iterating from a starting vector. 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.
Keywords: Numerical Optimization; Heterogeneous Agent Models (search for similar items in EconPapers)
JEL-codes: C61 C63 D58 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-cmp and nep-ecm
Note: Type of Document - PDF; prepared on MikTeX; pages: 47; figures: included/
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (6) Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:wpa:wuwpco:0303003
Access Statistics for this paper
More papers in Computational Economics from EconWPA
Series data maintained by EconWPA ().