Sparse portfolio rebalancing model based on inverse optimization

This paper considers a sparse portfolio rebalancing problem in which rebalancing portfolios with minimum number of assets are sought. This problem is motivated by the need to understand whether the initial portfolio is worthwhile to adjust or not, inducing sparsity on the selected rebalancing portfolio to reduce transaction costs (TCs), out-of-sample performance and small changes in portfolio. We propose a sparse portfolio rebalancing model by adding an l1 penalty item into the objective function of a general portfolio rebalancing model. In this way, the model is sparse with low TCs and can decide whether and which assets to adjust based on inverse optimization. Numerical tests on four typical data sets show that the optimal adjustment given by the proposed sparse portfolio rebalancing model has the advantage of sparsity and better out-of-sample performance than the general portfolio rebalancing model.

[1]  Garud Iyengar,et al.  Inverse conic programming with applications , 2005, Oper. Res. Lett..

[2]  Jianqing Fan,et al.  Asset Allocation and Risk Assessment with Gross Exposure Constraints for Vast Portfolios , 2008, 0812.2604.

[3]  Weijun Xu,et al.  An optimization model of the portfolio adjusting problem with fuzzy return and a SMO algorithm , 2011, Expert Syst. Appl..

[4]  Raman Uppal,et al.  A Generalized Approach to Portfolio Optimization: Improving Performance by Constraining Portfolio Norms , 2009, Manag. Sci..

[5]  Donald Goldfarb,et al.  Second-order cone programming , 2003, Math. Program..

[6]  R. Mansini,et al.  Models and Simulations for Portfolio Rebalancing , 2009 .

[7]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[8]  Jaroslava Hlouskova,et al.  Portfolio Selection and Transactions Costs , 2003, Comput. Optim. Appl..

[9]  H. Akaike,et al.  Information Theory and an Extension of the Maximum Likelihood Principle , 1973 .

[10]  G. Schwarz Estimating the Dimension of a Model , 1978 .

[11]  Jing-Rung Yu,et al.  Portfolio rebalancing model using multiple criteria , 2011, Eur. J. Oper. Res..

[12]  Chengxian Xu,et al.  Inverse optimization for linearly constrained convex separable programming problems , 2010, Eur. J. Oper. Res..

[13]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[14]  I. Daubechies,et al.  Sparse and stable Markowitz portfolios , 2007, Proceedings of the National Academy of Sciences.

[15]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[16]  Ruichu Cai,et al.  Portfolio adjusting optimization under credibility measures , 2010, J. Comput. Appl. Math..

[17]  Hiroshi Konno,et al.  MEAN-ABSOLUTE DEVIATION PORTFOLIO OPTIMIZATION MODEL UNDER TRANSACTION COSTS , 1999 .

[18]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[19]  Stephen P. Boyd,et al.  Portfolio optimization with linear and fixed transaction costs , 2007, Ann. Oper. Res..

[20]  Yi Wang,et al.  A Chance-Constrained Portfolio Selection Problem under T-Distribution , 2007, Asia Pac. J. Oper. Res..

[21]  Victor DeMiguel,et al.  Optimal Versus Naive Diversification: How Inefficient is the 1/N Portfolio Strategy? , 2009 .