Robust and Sparse Portfolio: Optimization Models and Algorithms

• Published in: Mathematics (Basel) Vol. 11; no. 24; p. 4925
• Main Authors: Zhao, Hongxin, Jiang, Yilun, Yang, Yizhou
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.12.2023
• Subjects: Administrative expenses; Algorithms; Euclidean space; Investment analysis; Optimization; Optimization models; Parameter uncertainty; penalty-alternating-direction method; portfolio optimization; robustness; Robustness (mathematics); Short sales; Sparsity; uncertainty set; Volatility
• ISSN: 2227-7390; 2227-7390
• DOI: 10.3390/math11244925

The robust and sparse portfolio selection problem is one of the most-popular and -frequently studied problems in the optimization and financial literature. By considering the uncertainty of the parameters, the goal is to construct a sparse portfolio with low volatility and decent returns, subject to other investment constraints. In this paper, we propose a new portfolio selection model, which considers the perturbation in the asset return matrix and the parameter uncertainty in the expected asset return. We define three types of stationary points of the penalty problem: the Karush–Kuhn–Tucker point, the strong Karush–Kuhn–Tucker point, and the partial minimizer. We analyze the relationship between these stationary points and the local/global minimizer of the penalty model under mild conditions. We design a penalty alternating-direction method to obtain the solutions. Compared with several existing portfolio models on seven real-world datasets, extensive numerical experiments demonstrate the robustness and effectiveness of our model in generating lower volatility.