On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms

References

• Attouch H, Bolte J, Svaiter BF (2013) Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Programming Ser. A 137(1–2):91–129.Crossref, Google Scholar
• Bahmani S, Raj B, Boufounos PT (2013) Greedy sparsity-constrained optimization. J. Machine Learn. Res. 14(1):807–841.Google Scholar
• Beck A, Eldar YC (2013) Sparsity constrained nonlinear optimization: Optimality conditions and algorithms. SIAM J. Optim. 23(3): 1480–1509.Crossref, Google Scholar
• Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1): 183–202.Crossref, Google Scholar
• Blumensath T, Davies ME (2008) Iterative thresholding for sparse approximations. J. Fourier Anal. Appl. 14(5):629–654.Crossref, Google Scholar
• Blumensath T, Davies ME (2009) Iterative hard thresholding for compressed sensing. Appl. Comput. Harmonic Anal. 27(3):265–274.Crossref, Google Scholar
• Blumensath T, Davies ME (2009) Normalised iterative hard thresholding; guaranteed stability and performance. IEEE J. Selected Topics Signal Processing 4(2):298–309.Google Scholar
• Bolte J, Sabach S, Teboulle M (2014) Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Programming Ser. A 146(1–2):459–494.Crossref, Google Scholar
• Bruckstein AM, Donoho DL, Elad M (2009) From sparse solutions of systems of equations to sparse modeling of signals and images. SIAM Rev. 51(1):34–81.Crossref, Google Scholar
• Candes E, Tao T (2007) The Dantzig selector: Statistical estimation when p is much larger than n. Ann. Statist. 35(6):2313–2351.Crossref, Google Scholar
• Candes EJ, Tao T (2005) Decoding by linear programming. IEEE Trans. Inform. Theory 51(12):4203–4215.Crossref, Google Scholar
• Cartis C, Thompson A (2013) A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing. Technical Report NA-13/20, Mathematical Institute, University of Oxford, Oxford, UK).Google Scholar
• Chen S, Donoho D, Saunders M (1998) Atomic decomposition by basis pursuit. SIAM J. Scientific Comput. 20(1):33–61.Crossref, Google Scholar
• Davenport MA, Duarte MF, Eldar YC, Kutyniok G (2011) Introduction to compressed sensing. Preprint:1–68.Google Scholar
• David LD, Elad M (2003) Optimally sparse representation in general (nonorthogonal) dictionaries via L1 minimization. Proc. Natl. Acad. Sci. 100(5):2197–2202.Crossref, Google Scholar
• Duarte MF, Eldar YC (2011) Structured compressed sensing: From theory to applications. IEEE Trans. Signal Processing 59(9): 4053–4085.Crossref, Google Scholar
• Kiwiel KC (2007) On linear-time algorithms for the continuous quadratic knapsack problem. J. Optim. Theory Appl. 134(3):549–554. [English.]Crossref, Google Scholar
• Kyrillidis A, Becker S, Cevher V, Koch C (2013) Sparse projections onto the simplex. Preprint, arXiv: 1206.1529 28.Google Scholar
• Lu Z (2013) Iterative hard thresholding methods for l0 regularized convex cone programming. Math. Programming Ser. A 147(1–2): 125–154.Crossref, Google Scholar
• Lu Z, Zhang Y (2013) Sparse approximation via penalty decomposition methods. SIAM J. Optim. 23(4):2448–2478.Crossref, Google Scholar
• Luss R, Teboulle M (2013) Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint. SIAM Rev. 55(1):65–98.Crossref, Google Scholar
• Mallat S, Zhang Z (1993) Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Processing 41(12):3397–3415.Crossref, Google Scholar
• More J, Sorensen D (1983) Computing a trust region step. SIAM J. Sci. Statist. Comput. 4(3):553–572.Crossref, Google Scholar
• Needell D, Tropp JA (2009) CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmonic Anal. 26(3):301–321.Crossref, Google Scholar
• Pan L, Xiu N, Zhou S Gradient support projection algorithm for affine feasibility problem with sparsity and nonnegativity. Preprint, http://arxiv-web3.library.cornell.edu/pdf/1406.7178v1.pdf.Google Scholar
• Rockafellar RT (1981) The Theory of Subgradients and Its Applications to Problems of Optimization, R&E, Vol. 1 (Heldermann Verlag, Berlin).Google Scholar
• Rockafellar RT, Wets RJ-B (1998) Variational analysis. Grundlehren der mathematischen Wissenschaften (Fundamental Principles of Mathematical Sciences), Vol. 317 (Springer, Berlin).Crossref, Google Scholar
• Smith NA, Tromble RW (2004) Sampling uniformly from the unit simplex. Technical report, Johns Hopkins University, Baltimore.Google Scholar
• Takeda A, Niranjan M, Gotoh J, Kawahara Y (2012) Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios. Comput. Management Sci. 10(1):21–49.Crossref, Google Scholar
• Tropp JA, Wright SJ (2010) Computational methods for sparse solution of linear inverse problems. Proc. IEEE 98(6):948–958.Crossref, Google Scholar