Advertisement

Sparsity and Performance Enhanced Markowitz Portfolios Using Second-Order Cone Programming

  • Noam GoldbergEmail author
  • Ishy Zagdoun
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 991)

Abstract

A mixed-integer second order cone program (MISOCP) formulation is proposed for solving Markowitz’s asset portfolio construction problem under a cardinality constraint. Compared with a standard alternative big-M linearly constrained formulation, our reformulation is solved significantly faster using state-of-the-art integer programming solvers. We consider learning methods that are based on the MISCOP formulation: cardinality-constrained Markowitz (CCM) solves the MISCOP for a given cardinality k and training set data of asset returns. We also find reinforcing evidence for factor model theory in the selection of factors to form optimal CCM portfolios. For large datasets in the absence of a hard-cardinality constraint, we propose a method (CCM-R) that is based on the continuous relaxation of our MISCOP, where k selected by rolling time window validation. In predictive performance experiments, based on historical stock exchange data, our learning methods usually outperform a competing extension of the Markowitz model that penalizes the L1 norm of asset weights.

Keywords

SOCP Markowitz Perspective reformulation Sparsity 

Notes

Acknowledgement

A. Ben-Tal is acknowledged for suggesting factor models.

References

  1. 1.
    Akturk, M.S., Alper, A., Sinan, G.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37(3), 187–191 (2009)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bonami, P., Lejeune, M.: An exact solution approach for portfolio optimization problems under stochastic and integer constraints. Oper. Res. 57(3), 650–670 (2009)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Brodie, J., Daubechies, I., Mol, C.D., Giannone, D., Loris, I.: Sparse and stable Markowitz portfolios. Proc. Natl. Acad. Sci. 106(30), 12267–12272 (2009).  https://doi.org/10.1073/pnas.0904287106CrossRefGoogle Scholar
  4. 4.
    DeMiguel, V., Garlappi, L., Uppal, R.: Optimal versus naive diversification: how inefficient is the 1/n portfolio strategy? Rev. Financ. Stud. 5, 1915–1953 (2009)CrossRefGoogle Scholar
  5. 5.
    Fama, E.F., French, K.R.: The cross-section of expected stock returns. J. Financ. 2, 427–465 (1992)CrossRefGoogle Scholar
  6. 6.
    Goldberg, N., Leyffer, S., Munson, T.: A new perspective on convex relaxations of sparse SVM. In: Proceedings of the 2013 SIAM International Conference on Data Mining, pp. 450–457 (2013).  https://doi.org/10.1137/1.9781611972832.50
  7. 7.
    Günlük, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124, 183–205 (2010)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Li, J.: Sparse and stable portfolio selection with parameter uncertainty. Bus. & Econ. Stat. 33(3):381–392 (2015)Google Scholar
  9. 9.
    Lobo, M.S., Fazel, M., Boyd, S.: Portfolio optimization with linear and fixed transaction costs. Ann. Oper. Res. 152(1), 341 (2007).  https://doi.org/10.1007/s10479-006-0145-1MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Markowitz, H.: Portfolio selection. J. Financ. 7(1), 77–91 (1952).  https://doi.org/10.1111/j.1540-6261.1952.tb01525.xCrossRefGoogle Scholar
  11. 11.
    Gurobi Optimization: Inc.: Gurobi optimizer reference manual. http://www.gurobi.com (2014)
  12. 12.
    Sharpe, W.F.: Mutual fund performance. J. Bus. 39(1), 119–138 (1966). Supplement on Security PricesCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of ManagementBar-Ilan UniversityRamat GanIsrael
  2. 2.Department of MathematicsBar-Ilan UniversityRamat GanIsrael

Personalised recommendations