Robust Growth-Optimal Portfolios

Napat Rujeerapaiboon (), Daniel Kuhn () and Wolfram Wiesemann ()
Additional contact information
Napat Rujeerapaiboon: Risk Analytics and Optimization Chair, École Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland
Daniel Kuhn: Risk Analytics and Optimization Chair, École Polytechnique Fédérale de Lausanne, CH-1015 Lausanne, Switzerland
Wolfram Wiesemann: Imperial College Business School, Imperial College London, London SW7 2AZ, United Kingdom

Management Science, 2016, vol. 62, issue 7, 2090-2109

Abstract: The growth-optimal portfolio is designed to have maximum expected log return over the next rebalancing period. Thus, it can be computed with relative ease by solving a static optimization problem. The growth-optimal portfolio has sparked fascination among finance professionals and researchers because it can be shown to outperform any other portfolio with probability 1 in the long run. In the short run, however, it is notoriously volatile. Moreover, its computation requires precise knowledge of the asset return distribution, which is not directly observable but must be inferred from sparse data. By using methods from distributionally robust optimization, we design fixed-mix strategies that offer similar performance guarantees as the growth-optimal portfolio but for a finite investment horizon and for a whole family of distributions that share the same first- and second-order moments. We demonstrate that the resulting robust growth-optimal portfolios can be computed efficiently by solving a tractable conic program whose size is independent of the length of the investment horizon. Simulated and empirical backtests show that the robust growth-optimal portfolios are competitive with the classical growth-optimal portfolio across most realistic investment horizons and for an overwhelming majority of contaminated return distributions. This paper was accepted by Yinyu Ye, optimization .

Keywords: portfolio optimization; growth-optimal portfolio; distributionally robust optimization; value-at-risk; second-order cone programming; semidefinite programming (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.2015.2228 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:62:y:2016:i:7:p:2090-2109

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().