摘要

In this paper, we propose an optimal trade-off model for portfolio selection with sensitivity of parameters, which are estimated from historical data. Mathematically, the model is a quadratic programming problem, whose objective function contains three terms. The first term is a measurement of risk. And the later two are the maximum and minimum sensitivity, which are non-convex and non-smooth functions and lead to the whole model to be an intractable problem. Then we transform this quadratic programming problem into an unconstrained composite problem equivalently. Furthermore, we develop a modified accelerated gradient (AG) algorithm to solve the unconstrained composite problem. The convergence and the convergence rate of our algorithm are derived. Finally, we perform both the empirical analysis and the numerical experiments. The empirical analysis indicates that the optimal trade-off model results in a stable return with lower risk under the stress test. The numerical experiments demonstrate that the modified AG algorithm outperforms the existed AG algorithm for both CPU time and the iterations, respectively.