English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

This paper focuses on finding starting-values for maximum likelihood estimation of Vector STAR models. Based on a Monte Carlo exercise, different procedures are evaluated. Their performance is assessed w.r.t. model fit and computational effort. I employ i) grid search algorithms, and ii) heuristic optimization procedures, namely, differential evolution, threshold accepting, and simulated annealing. In the equation-by-equation starting-value search approach the procedures achieve equally good results. Unless the errors are cross-correlated, equation-by-equation search followed by a derivative-based algorithm can handle such an optimization problem sufficiently well. This result holds also for higher-dimensional VSTAR models with a slight edge for the heuristic methods. Being faced with more complex Vector STAR models for which a multivariate search approach is required, simulated annealing and differential evolution outperform threshold accepting and the grid with a zoom.

Finding Starting-Values for Maximum Likelihood Estimation of Vector STAR Models