Optimizing the Garch Model–An Application of Two Global and Two Local Search Methods
- Kwami Adanu
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Results from our optimization exercise clearly show the advantage of using the random search algorithms when we anticipate the search for the global optimum to be difficult. When the number of parameters in the model is relatively small (nine parameters) Differential Evolution performs better than Genetic Algorithm. However, when the number of parameters in the model is relatively large (fifteen parameters) the reverse case is true. A comparison of the Quasi-Newton and Simplex methods also shows that both the Quasi-Newton algorithm of shazam and the simplex algorithm of fminsearch are sensitive to starting values. However, allowing shazam to set its starting values or using the PRESAMP option to set the starting values produced the best results for shazam. The general conclusion of this paper is that the choice of optimization technique for difficult optimization problems like the one attempted here should be based on problem attributes. When in doubt, multiple techniques should be applied and the estimated results evaluated.
- Doornik, J.A. (2000). Multimodality and the GARCH likelihood. A Paper Presented at The World Conference of Econometric Society.
- Holland, J. (1992). Adaptation in Natural and Artificial Systems, 2nd edition. MIT Press.
- Houck, C., Joines, J. and Kay, M. (1996). A Genetic Algorithm for Function Optimization: A Matlab Implementation. ACM Transactions on Mathematical Software.
- Jerrel, M. (2000). Applications of Public Domain Global Optimization Software to Difficult Econometric Functions. Computing in Economics and Finance, No. 161.
- Lagarias, J.C., Reeds, J.A., Wright, M.H. and Wright, P.E. (1998). Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions. SIAM Journal of Optimization, 9(1), 112–147. CrossRef
- Storn, R. and Price, K. (1995). Differential Evolution – A Simple and Efficient Adaptive Scheme for Global Optimization Over Continuous Spaces. Technical Report TR-95-012, ICSI.
- The solver for the GA (GAOT.ZIP) written by Houck et al. (1996) can be found at the following HTML address: http://www.ie.ncsu.edu/mirage/GAToolBox/gaot/.
- The solver for the DE (Devec3.m) can also be found at the following internet address: http://www.icsi.berkeley.edu/storn/code.html#matl.
- Optimizing the Garch Model–An Application of Two Global and Two Local Search Methods
Volume 28, Issue 3 , pp 277-290
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers-Plenum Publishers
- Additional Links
- global optimum
- genetic algorithm
- differential evolution
- Quasi-Newton algorithm
- Simplex method
- Industry Sectors
- Kwami Adanu (1)
- Author Affiliations
- 1. Michigan State University, East Lansing, USA