Article ID: | iaor19992114 |
Country: | United Kingdom |
Volume: | 16 |
Issue: | 6 |
Start Page Number: | 439 |
End Page Number: | 463 |
Publication Date: | Nov 1997 |
Journal: | International Journal of Forecasting |
Authors: | Aksu Celal, Gunter Sevket I. |
Keywords: | combining forecasts |
There exists theoretical and empirical evidence on the efficiency and robustness of Non-negativity Restricted Least Squares combinations of forecasts. However, the computational complexity of the method hinders its widespread use in practice. We examine various optimizing and heuristic computational algorithms for estimating NRLS combination models and provide certain CPU-time reducing implementations. We empirically compare the combination weights identified by the alternative algorithms and their computational demands based on a total of more than 66,000 models estimated to combine the forecasts of 37 firm-specific accounting earnings series. The