2011
DOI: 10.1080/14697688.2010.481634
|View full text |Cite
|
Sign up to set email alerts
|

Identifying small mean-reverting portfolios

Abstract: Given multivariate time series, we study the problem of forming portfolios with maximum mean reversion while constraining the number of assets in these portfolios. We show that it can be formulated as a sparse canonical correlation analysis and study various algorithms to solve the corresponding sparse generalized eigenvalue problems. After discussing penalized parameter estimation procedures, we study the sparsity versus predictability tradeoff and the impact of predictability in various markets.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
36
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 63 publications
(36 citation statements)
references
References 45 publications
(49 reference statements)
0
36
0
Order By: Relevance
“…They are often the ideal choice for solving small to medium size generic SDP problems. It is not difficult to see that (6) can be cast as a standard log-det SDP problem with p(p + 1)/2 linear constraints. In [44], Yuan and Lin actually applied a standard primal-dual interior-point method to solve (6).…”
mentioning
confidence: 99%
See 4 more Smart Citations
“…They are often the ideal choice for solving small to medium size generic SDP problems. It is not difficult to see that (6) can be cast as a standard log-det SDP problem with p(p + 1)/2 linear constraints. In [44], Yuan and Lin actually applied a standard primal-dual interior-point method to solve (6).…”
mentioning
confidence: 99%
“…It is not difficult to see that (6) can be cast as a standard log-det SDP problem with p(p + 1)/2 linear constraints. In [44], Yuan and Lin actually applied a standard primal-dual interior-point method to solve (6). However, as we have pointed out earlier, a standard IPM solver would encounter a severe computational bottleneck or even become impractical when p is large since its computational cost per iteration is at least O(p 6 ).…”
mentioning
confidence: 99%
See 3 more Smart Citations