We study the problem of constructing sparse and fast mean revert- ing portfolios. The problem is motivated by convergence trading and formu- lated as a generalized eigenvalue problem with a cardinality constraint [6]. We use a proxy of mean reversion coefficient, the direct Ornstein-Uhlenbeck (OU) estimator, which can be applied to both stationary and nonstationary data. In addition, we introduce three different methods to enforce the sparsity of the solutions. One method uses the ratio of l1 and l2 norms and the other two use l1 norm. We analyze various formulations of the resulting non-convex opti- mization problems and develop efficient algorithms to solve them for portfolio sizes as large as hundreds. By adopting a simple convergence trading strat- egy, we test the performance of our sparse mean reverting portfolios on both synthetic and historical real market data. In particular, the l1 regularization method, in combination with quadratic program formulation as well as differ-ence of convex functions and least angle regression treatment, gives fast and robust performance on large out-of-sample data set.
To appear in Journal of Scientific Computing (JOMP).