Lagrangian relaxation procedure for cardinality-constrained portfolio optimization

This paper studies a portfolio-selection problem subject to a cardinality constraint, that is, the number of securities in a portfolio is restricted to a certain limit. The problem is formulated as a cardinality-constrained quadratic programming problem, and a dedicated Lagrangian relaxation method is developed. In contrast to many existing Lagrangian relaxation methods, the approach presented in the paper is able to take advantage of the special structure of the objective function rather than the special structure of the constraints. The algorithm developed here has been applied to track the major market indices, such as the S&P 500, S&P 100, FTSE 100, and FTSE 250, using real data, and the computational results are promising.

[1]  G. Mitra,et al.  Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints , 2001 .

[2]  B. Stone.  A Linear Programming Formulation of the General Portfolio Selection Problem , 1973, Journal of Financial and Quantitative Analysis.

[3]  Miguel A. Lejeune,et al.  An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints , 2009, Oper. Res..

[4]  William N. Goetzmann,et al.  Active Portfolio Management , 1999 .

[5]  Duan Li,et al.  OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION , 2006 .

[6]  Daniel Bienstock,et al.  Computational Study of a Family of Mixed-Integer Quadratic Programming Problems , 1995, IPCO.

[7]  Yazid M. Sharaiha,et al.  Heuristics for cardinality constrained portfolio optimisation , 2000, Comput. Oper. Res..

[8]  S. Ross.  The arbitrage theory of capital asset pricing , 1976 .

[9]  H. Konno,et al.  Mean-absolute deviation portfolio optimization model and its applications to Tokyo stock market , 1991 .

[10]  S. Ross.  Return, Risk and Arbitrage , 1975 .

[11]  George L. Nemhauser,et al.  A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs , 2008, INFORMS J. Comput..

[12]  A. Swinburne,et al.  Return , 1888, The Hospital.

[13]  Pierre Bonami,et al.  An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints , 2007 .

[14]  Dimitris Bertsimas,et al.  Algorithm for cardinality-constrained quadratic optimization , 2009, Comput. Optim. Appl..

[15]  Robert A. Korajczyk,et al.  The Arbitrage Pricing Theory and Multifactor Models of Asset Returns , 1993, Finance.