Sparsity constrained optimization problems via disjunctive programming

References

• Donoho D. Denoising by soft-thresholding. IEEE Tans Inform Theory. 1995;41:612–627.
   Google Scholar
• Mallat S. A wavelet tour of signal processing: the sparse way. Burlington (MA): Academic; 2008.
   Google Scholar
• Mordukhovich B. Lipschitzian stability of constraint systems and generalized equations. Nonlinear Anal: Theory Methods Appl. 1994;22(2):173–206.
   Web of Science ®Google Scholar
• Taubman DS, Marcellin MW. JPEG2000: image compression fundamentals, standards and practice. Springer International Series in Engineering and Computer Science; 2012.
   Google Scholar
• Natarajan BK. Sparse approximate solutions to linear systems. SIAM J Comput. 1995;24(2):227–234.
   Web of Science ®Google Scholar
• Bertsimas D, Shioda R. Algorithm for cardinality-constrained quadratic optimization. Comput Optim Appl. 2009;43(1):1–22.
   Web of Science ®Google Scholar
• Murray W, Shek H. A local relaxation method for the cardinality constrained portfolio optimization problem. Comput Optim Appl. 2012;53(3):681–709.
   Web of Science ®Google Scholar
• Červinka M, Kanzow C, Schwartz A. Constraint qualifications and optimality conditions for optimization problems with cardinality constraints. Math Program. 2016;160(1–2):353–377.
   Web of Science ®Google Scholar
• Le Thi HA, Dinh TP, Le HM, et al. DC approximation approaches for sparse optimization. Eur J Oper Res. 2015;244(1):26–46.
   Web of Science ®Google Scholar
• Movahedian N, Nobakhtian S, Sarabadan M. Nonsmooth sparsity constrained optimization problems: optimality conditions. Optim Lett. 2019;13(5):1027–1038.
   Web of Science ®Google Scholar
• Pan LL, Xiu NH, Zhou SL. On solutions of sparsity constrained optimization. J Oper Res Soc China. 2015;3(4):421–439.
   Web of Science ®Google Scholar
• Beck A, Eldar YC. Sparsity constrained nonlinear optimization: optimality conditions and algorithms. SIAM J Optim. 2013;23(3):1480–1509.
   Web of Science ®Google Scholar
• Lu Z, Zhang Y. Sparse approximation via penalty decomposition methods. SIAM J Optim. 2013;23(4):2448–2478.
   Web of Science ®Google Scholar
• Bauschke HH, Luke DR, Phan HM, et al. Restricted normal cones and sparsity optimization with affine constraints. Found Comput Math. 2014;14(1):63–83.
   Web of Science ®Google Scholar
• Li X, Song W. The first-order necessary conditions for sparsity constrained optimization. J Oper Res Soc China. 2015;3(4):521–535.
   Web of Science ®Google Scholar
• Scheel H, Scholtes S. Mathematical programs with complementarity constraints: stationarity, optimality, and sensitivity. Math Oper Res. 2000;25(1):1–22.
   Web of Science ®Google Scholar
• Scholtes S. Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J Optim. 2001;11:918–936.
   Web of Science ®Google Scholar
• Flegel ML, Kanzow C, Outrata JV. Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints. Set-Valued Anal. 2007;15(2):139–162.
   Google Scholar
• Rockafellar RT, Wets RJB. Variational analysis. Vol. 317, Springer-Verlag Berlin Heidelberg; 2009.
   Google Scholar
• Bazaraa MS, Sherali HD, Shetty CM. Nonlinear programming: theory and algorithms. John Wiley & Sons New-York; 2013.
   Google Scholar
• Gfrerer H. Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints. SIAM J Optim. 2014;24(2):898–931.
   Web of Science ®Google Scholar
• Mehlitz P. On the linear independence constraint qualification in disjunctive programming. Optimization. 2020;69:2241–2277.
   Web of Science ®Google Scholar
• Bazaraa MS, Shetty CM. Foundations of optimization. Vol. 122, Springer-Verlag Berlin Heidelberg; 2012.
   Google Scholar
• Borwein J, Lewis AS. Convex analysis and nonlinear optimization: theory and examples. CMS Books in Mathematics. Springer Science & Business Media; 2010.
   Google Scholar
• Gould NI, Toint PL. A note on the convergence of barrier algorithms to second-order necessary points. Math Program. 1999;85(2):433–438.
   Web of Science ®Google Scholar
• Haeser G, Ramos A. New constraint qualifications with second-order properties in nonlinear optimization. J Optim Theory Appl. 2020;184(2):494–506.
   Web of Science ®Google Scholar
• Minchenko L, Leschov A. On strong and weak second-order necessary optimality conditions for nonlinear programming. Optim. 2016;65(9):1693–1702.
   Web of Science ®Google Scholar
• Cai D, He X, Han J. Spectral regression: a unified approach for sparse subspace learning. In: Seventh IEEE International Conference on Data Mining (ICDM 2007). IEEE; 2007. p. 73–82.
   Google Scholar
• Chen Y, Ye Y, Wang M. Approximation hardness for A class of sparse optimization problems. J Mach Learn Res. 2019;20(38):1–27.
   Google Scholar
• Moghaddam B, Weiss Y, Avidan S. Generalized spectral bounds for sparse LDA. In: Proceedings of the 23rd International Conference on Machine Learning. ACM; 2006. p. 641–648.
   Google Scholar
• Guler O. Foundations of optimization. Springer; 2010. (Graduate texts in mathematics; 258).
   Google Scholar
• Liu T, Pong TK, Takeda A. A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Math Program. 2019;176(1–2):339–367.
   Web of Science ®Google Scholar
• Liben-Nowell D, Kleinberg J. The link prediction problem for social networks. J Am Soc Inf Sci Technol. 2007;58(7):1019–1031.
   Web of Science ®Google Scholar
• Richard E, Savalle P-A, Vayatis N. Estimation of simultaneously sparse and low rank matrices; 2012. arXiv:1206.6474.
   Google Scholar
• Zhang J, Chen J, Zhi S, et al. Link prediction across aligned networks with sparse and low rank matrix estimation. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE); 2017. p. 971–982.
   Google Scholar
• Zhou K, Zha H, Song L. Learning social infectivity in sparse low-rank networks using multi-dimensional Hawkes processes. Artificial Intell Stat. 2013;31:641–649.
   Google Scholar