A Novel Approach for Solving Convex Problems with Cardinality Constraints
暂无分享,去创建一个
[1] Yurii Nesterov,et al. Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.
[2] P. Tseng. Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization , 2001 .
[3] Paul J. Goulart,et al. A novel method for modelling cardinality and rank constraints , 2014, 53rd IEEE Conference on Decision and Control.
[4] Heinz H. Bauschke,et al. Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.
[5] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[6] Alan J. Miller. Subset Selection in Regression , 1992 .
[7] Stephen P. Boyd,et al. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..
[8] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[9] T. Blumensath,et al. Iterative Thresholding for Sparse Approximations , 2008 .
[10] Jean Ponce,et al. Sparse Modeling for Image and Vision Processing , 2014, Found. Trends Comput. Graph. Vis..
[11] Stephen P. Boyd,et al. A General System for Heuristic Solution of Convex Problems over Nonconvex Sets , 2016, 1601.07277.
[12] W. Marsden. I and J , 2012 .
[13] Yonina C. Eldar,et al. Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms , 2012, SIAM J. Optim..
[14] David L Donoho,et al. Compressed sensing , 2006, IEEE Transactions on Information Theory.
[15] Akiko Takeda,et al. DC formulations and algorithms for sparse optimization problems , 2017, Mathematical Programming.
[16] Stephen P. Boyd,et al. Enhancing Sparsity by Reweighted ℓ1 Minimization , 2007, 0711.1612.
[17] Fu Lin,et al. Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers , 2011, IEEE Transactions on Automatic Control.