A linear programming model for selection of sparse high-dimensional multiperiod portfolios

Abstract

This paper studies the mean-variance (MV) portfolio problems under static and dynamic settings, particularly for the case in which the number of assets (p) is larger than the number of observations (n). We prove that the classical plug-in estimation seriously distorts the optimal MV portfolio in the sense that the probability of the plug-in portfolio outperforming the bank deposit tends to 50% for p ≫ n and a large n. We investigate a constrained ℓ1 minimization approach to directly estimate effective parameters that appear in the optimal portfolio solution. The proposed estimator is implemented efficiently with linear programming, and the resulting portfolio is called the linear programming optimal (LPO) portfolio. We derive the consistency and the rate of convergence for LPO portfolios. The LPO procedure essentially filters out unfavorable assets based on the MV criterion, resulting in a sparse portfolio. The advantages of the LPO portfolio include its computational superiority and its applicability for dynamic settings and non-Gaussian distributions of asset returns. Simulation studies validate the theory and illustrate its finite-sample properties. Empirical studies show that the LPO portfolios outperform the equally weighted portfolio and the estimated optimal portfolios using shrinkage and other competitive estimators.