A local relaxation method for the cardinality constrained portfolio optimization problem. (English) Zbl 1264.90133
Summary: The NP-hard nature of cardinality constrained mean-variance portfolio optimization problems has led to a number of different algorithms with varying degrees of success in reaching optimality given limited computational resources and under the presence of strict time constraints present in practice. The proposed local relaxation algorithm explores the inherent structure of the objective function. It solves a sequence of small, local, quadratic-programs by first projecting asset returns onto a reduced metric space, followed by clustering in this space to identify sub-groups of assets that best accentuate a suitable measure of similarity amongst different assets. The algorithm can either be cold started using a suitable heuristic method such as the centroids of initial clusters or be warm started based on the last output. Results, using a basket of up to 3,000 stocks and with different cardinality constraints, indicates that the proposed algorithm can lead to significant performance gain over popular branch-and-cut methods. One key application of this algorithm is in dealing with large scale cardinality constrained portfolio optimization under tight time constraint, such as for the purpose of index tracking or index arbitrage at high frequency.
Keywords:
portfolio optimization; local relaxation method; nonlinear programming; cardinality constrained optimizationReferences:
| [1] | Bienstock, D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74, 121–140 (1995) · Zbl 0855.90090 |
| [2] | Chang, T.-J., Meade, N., Beasley, J.E., Sharaiha, Y.M.: Heuristics for cardinality constrained portfolio optimisation. Comput. Oper. Res. 27(13), 1271–1302 (2000) · Zbl 1032.91074 · doi:10.1016/S0305-0548(99)00074-X |
| [3] | Clausen, J.: Branch and bound algorithms–principles and examples (2003) |
| [4] | Dakin, T.J.: A tree-search algorithm for mixed integer programming problems. Comput. J. 8(3), 250–255 (1965) · Zbl 0154.42004 · doi:10.1093/comjnl/8.3.250 |
| [5] | Goldfarb, D., Idnani, A.: Dual and primal-dual methods for solving strictly convex quadratic programs. In: Numerical Analysis. Springer, Berlin (1982) · Zbl 0497.65037 |
| [6] | Hansen, P.R., Huang, Z., Shek, H.H.: Realized GARCH: a joint model for returns and realized measures of volatility. J. Appl. Econom. (2011). doi: 10.1002/jae.1234 . ISSN 1099-1255 |
| [7] | Hastie, T., Tibshirani, R., Friedman, J. (eds.): The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer Series in Statistics. Springer, Berlin (2003) · Zbl 1273.62005 |
| [8] | Hosrt, R., Pardalos, P.M. (eds.): Handbook of Global Optimization. Kluwer Academic, Norwel (1995) |
| [9] | IBM: IBM ILOG CPLEX optimization studio V12.2 documentation. IBM ILOG (2010) |
| [10] | Konno, H, Yamamoto, R: Integer programming approaches in mean-risk models. Comput. Manag. Sci. 2(4), 339–351 (2005). doi: 10.1007/s10287-005-0038-9 · Zbl 1128.91027 · doi:10.1007/s10287-005-0038-9 |
| [11] | Konno, H., Yamazaki, H.: Mean-absolute deviation portfolio optimization model and its applications to Tokyo stock market. Manag. Sci. 37(5), 519–531 (1991) · doi:10.1287/mnsc.37.5.519 |
| [12] | Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497–520 (1960) · Zbl 0101.37004 · doi:10.2307/1910129 |
| [13] | Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput. Optim. Appl. 18(3), 295–309 (2001) · Zbl 1009.90074 · doi:10.1023/A:1011241421041 |
| [14] | Loraschi, A., Tettamanzi, A., Tomassini, M., Verda, P.: Distributed genetic algorithms with an application to portfolio selection. In: Artificial Neural Nets and Genetic, pp. 384–387. Springer, Berlin (1995) |
| [15] | Markowitz, H.M.: Portfolio selection. J. Finance 7, 77–91 (1952) |
| [16] | Markowitz, H.M. (ed.): Mean-Variance Analysis in Portfolio Choice and Capital Markets. Blackwell, Oxford (1987) · Zbl 0757.90003 |
| [17] | Murray, W., Shanbhag, V.V.: A local relaxation method for nonlinear facility location problems. Multiscale Optim. Methods Appl. 82, 173–204 (2006) · Zbl 1100.90022 · doi:10.1007/0-387-29550-X_7 |
| [18] | Murray, W., Shanbhag, U.V.: A local relaxation approach for the siting of electrical substation. Comput. Optim. Appl. 38(3), 299–303 (2007) · doi:10.1007/s10589-007-9062-8 |
| [19] | Perold, A.F.: Large scale portfolio optimization. Manag. Sci. 30(10), 1143–1160 (1984) · Zbl 0548.90008 · doi:10.1287/mnsc.30.10.1143 |
| [20] | Shaw, D.X., Liu, S., Kopman, L.: Lagrangian relaxation procedure for cardinality-constrained portfolio optimization. Optim. Methods Softw. 23(3), 411–420 (2008) · Zbl 1162.90531 · doi:10.1080/10556780701722542 |
| [21] | Shek, H.H.: Modeling high frequency market order dynamics using self-excited point process. Working paper, Stanford University (2010) |
| [22] | Shek, H.H.: Statistical and algorithm aspects of optimal portfolios. PhD thesis (2010) |
| [23] | Yitzhaki, S.: Stochastic dominance, mean variance, and Gini’s mean difference. Am. Econ. Rev. 72(1), 178–185 (1982) |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
