| [1] Zou H, Hastie T, Tibshirani R. Sparse Principal Component Analysis[J]. Journal of Computational & Graphical Statistics, 2006, 15(2):265-286.[2] Wu M. A Direct Method for Building Sparse Kernel Learning Algorithms[M]. JMLR. org, 2006.[3] Brodie J, Daubechies I, De M C, et al. Sparse and stable Markowitz portfolios[J]. Proceedings of the National Academy of Sciences of the United States of America, 2009, 106(30):12267.[4] Tibshirani R. Regression shrinkage and selection via the lasso:a retrospective[J]. Journal of the Royal Statistical Society, 2011, 73(3):273-282.[5] Efron B, Hastie T, Johnstone I, et al. Least angle regression[J]. Annals of Statistics, 2004, 32(2):407-451.[6] Pan L L, Xiu N H, Fan J. Optimality conditions for sparse nonlinear programming[J]. Science China, 2017, 60(5):1-18.[7] Lu Z, Zhang Y. Penalty Decomposition Methods for L0-Norm Minimization[J]. Mathematics, 2010.[8] Lu Z, Zhang Y. Sparse Approximation via Penalty Decomposition Methods[J]. Siam Journal on Optimization, 2012, 23(4):2448-2478.[9] Chen X, Lu Z, Pong T K. Penalty methods for a class of non-Lipschitz optimization problems[J]. Mathematics, 2016, 26(3):1465-1492.[10] Ruiztorrubiano R. Cardinality constraints and dimensionality reduction in optimization problems[J]. Universidad Autónoma De Madrid, 2012.[11] Karmarkar N. A new polynomial-time algorithm for linear programming[J]. Combinatorica, 1984, 4(4):373-395.[12] 加里. 计算机和难解性[M]. 科学出版社, 1987.[13] Guo K, Han D R, Wu T T. Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints[J]. International Journal of Computer Mathematics, 2016, 94(8):1-18.[14] Duration W T S D S. The Method of Multipliers for Equality Constrained Problems-Constrained Optimization and Lagrange Multiplier Methods-Chapter 2[J]. Constrained Optimization & Lagrange Multiplier Methods, 1982, 95-157.[15] Boyd S, Parikh N, Chu E, et al. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers[J]. Foundations & Trends in Machine Learning, 2011, 3(1):1-122.[16] Bai Y, Liang R, Yang Z. Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables[J]. Optimization Methods and Software, 2016, 31(5):1089-1109.[17] Ruiz-Torrubiano R, Suárez A. A hybrid optimization approach to index tracking[J]. Annals of Operations Research, 2009, 166(1):57-71.[18] Xu F, Wang M, Dai Y H. A sparse enhanced indexation model with chance and cardinality constraints[J]. Journal of Global Optimization, 2017(3):1-21.[19] Xu F, Dai Y H, Zhao Z, Xu Z. Efficient projected gradient methods for a class of L0 constrained optimization[J]. Science China Mathematics, 2017, 60(1):1-xx.[20] Xu F, Lu Z, Xu Z. An efficient optimization approach for a cardinality-constrained index tracking problem[J]. Optimization Methods & Software, 2016, 31(2):258-271.[21] Rockafellar R T, Uryasev S. Optimization of Conditional Value-at-Risk[J]. Journal of Risk, 2000, 29(1):1071-1074.[22] Beasley J E. OR-Library:Distributing Test Problems by Electronic Mail[J]. Journal of the Operational Research Society, 1990, 41(11):1069-1072. |
