An efficient branch-and-bound strategy for subset vector autoregressive model selection

DOI10.1016/J.JEDC.2007.08.001zbMATH Open1181.62131OpenAlexW2085654879MaRDI QIDQ844693FDOQ844693

Manfred Gilli, Cristian Gatu, Erricos J. Kontoghiorghes, Peter Winker

Publication date: 19 January 2010

Published in: Journal of Economic Dynamics and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jedc.2007.08.001

Recommendations

• Efficient strategies for deriving the subset VAR models
• scientific article; zbMATH DE number 1179945
• On multivariate time series model selection involving many candidate VAR models
• Subset selection for vector autoregressive processes via adaptive Lasso
• Model selection for vector autoregressive processes via adaptive lasso

zbMATH Keywords

model selectionvector autoregressive modelbranch-and-bound algorithms

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Time series, auto-correlation, regression, etc. in statistics (GARCH) (62M10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Estimating the dimension of a model
• Matrix Analysis
• A new look at the statistical model identification
• Title not available (Why is that?)
• Title not available (Why is that?)
• A graph approach to generate all possible regression submodels
• Parallel algorithms for linear models. Numerical methods and estimation problems
• Fitting autoregressive models for prediction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient algorithms for computing the best subset regression models for large-scale problems
• Algorithms for computing the QR decomposition of a set of matrices with common columns
• Information complexity criteria for detecting influential observations in dynamic multivariate linear models using the genetic algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Constrained Least Squares Approach to the General Gauss-Markov Linear Model
• Fast Numerically Stable Computations for Generalized Linear Least Squares Problems
• An alternative approach for the numerical solution of seemingly unrelated regression equations models
• Efficient strategies for deriving the subset VAR models
• Identification of multivariate AR-models by threshold accepting
• Computing 3SLS solutions of simultaneous equation models with a possible singular variance-covariance matrix
• Estimation of VAR models: computational aspects
• An implicit enumeration algorithm for mining high dimensional data
• Optimal Lag Structure Selection in VEC-Models
• Estimating all possible SUR models with permuted exogenous data matrices derived from a VAR process

Cited In (6)

• Heuristic optimization methods for dynamic panel data model selection: application on the Russian innovative performance
• Order selection criteria for vector autoregressive models
• Covariate unit root tests with good size and power
• Subset selection for vector autoregressive processes via adaptive Lasso
• Boosting nonlinear additive autoregressive time series
• A graph approach to generate all possible regression submodels

This page was built for publication: An efficient branch-and-bound strategy for subset vector autoregressive model selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844693)