点击次数：

论文类型：期刊论文

发表时间：2017-02-01

发表刊物：OPTIMIZATION METHODS & SOFTWARE

收录刊物：SCIE、EI、SSCI

卷号：32

期号：1

页面范围：126-147

ISSN号：1055-6788

关键字：sparse portfolio selection; proximal alternating linearized minimization method; l(0) minimization; cardinality constrained portfolio selection

摘要：In this paper, we propose a penalty proximal alternating linearized minimization method for the large-scale sparse portfolio problems in which a sequence of penalty subproblems are solved by utilizing the proximal alternating linearized minimization framework and sparse projection techniques. For exploiting the structure of the problems and reducing the computation complexity, each penalty subproblem is solved by alternately solving two projection problems. The global convergence of the method to a Karush-Kuhn-Tucker point or a local minimizer of the problem can be proved under the characteristic of the problem. The computational results with practical problems demonstrate that our method can find the suboptimal solutions of the problems efficiently and is competitive with some other local solution methods.