Non-convex regularization and accelerated gradient algorithm for sparse portfolio selection. (4th March 2023)

• Record Type: Journal Article
• Authors: Li, Qian; Zhang, Wei; Wang, Guoqiang; Bai, Yanqin
• Is Part Of: Optimization methods and software. Volume 38:Number 2(2023)
• Page Start: 434
• Page End: 456
• Publication Date: 2023-03-04
• Subjects: Sparse portfolio selection -- non-convex regularization -- accelerated proximal algorithm -- linear convergence -- Sharpe ratio -- turnover; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2022.2142580
• Languages: English
• ISSNs: 1055-6788

Abstract

Abstract : In portfolio optimization, non-convex regularization has recently been recognized as an important approach to promote sparsity, while countervailing the shortcomings of convex penalty. In this paper, we customize the non-convex piecewise quadratic approximation (PQA) function considering the background of portfolio management and present the PQA regularized mean–variance model (PMV). By exposing the feature of PMV, we prove that a KKT point of PMV is a local minimizer if the regularization parameter satisfies a mild condition. Besides, the theoretical sparsity of PMV is analysed, which is associated with the regularization parameter and the weight parameter. To solve this model, we introduce the accelerated proximal gradient (APG) algorithm, whose improved linear convergence rate compared with proximal gradient (PG) algorithm is developed. Moreover, the optimal accelerated parameter of APG algorithm for PMV is attained. These theoretical results are further illustrated with numerical experiments. Finally, empirical analysis demonstrates that the proposed model has a better out-of-sample performance and a lower turnover than many other existing models on the tested datasets.