an l1 then l0 approach to the cardinality constrained mean-variance and mean-cvar portfolio optimization problems

Cardinality constrained portfolio optimization problems are widely used portfolio optimization models which incorporate restriction on the number of assets in the portfolio. being mixed-integer programming problems make them np-hard thus computationally challenging, specially for large number of assets. in this paper, we consider cardinality constrained mean-variance (ccmv) and cardinality constrained mean-cvar (ccmcvar) models and propose a hybrid algorithm to solve them. at first, it solves the relaxed model by replacing l_0-norm, which bounds the number of assets, by l_1-norm. then it removes those assets that do not significantly contribute on the portfolio and apply the original ccmv or ccmcvar model to the remaining subset of assets. to deal with the large number of scenarios in the ccmcvar model, conditional scenario reduction technique is applied. computational experiments on 3 large data sets show that the proposed approach is competitive with the original models from risk, return and sharpe ratio perspective while being significantly faster.