Sparse Solutions of a Class of Constrained Optimization Problems

References

• [1] Attouch H, Bolte J, Svaiter B (2013) Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods. Math. Programming 137(1):91–129.Crossref, Google Scholar
• [2] Beck A (2017) First-Order Methods in Optimization, vol. 25 (SIAM, Philadelphia).Crossref, Google Scholar
• [3] Bruckstein A, Donoho D, 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
• [4] Cai T, Liu W, Luo X (2011) A constrained ℓ1 minimization approach to sparse precision matrix estimation. J. Amer. Statist. Assoc. 106(494):594–607.Crossref, Google Scholar
• [5] Candès E, Tao T (2005) Decoding by linear programming. IEEE Trans. Inform. Theory 51(12):4203–4215.Crossref, Google Scholar
• [6] Candès 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
• [7] Candès E, Romberg J, Tao T (2006) Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math. 59(8):1207–1223.Crossref, Google Scholar
• [8] Chartrand R (2007) Exact reconstruction of sparse signals via nonconvex minimization. IEEE Signal Processing Lett. 14(10):707–710.Crossref, Google Scholar
• [9] Chen X (2012) Smoothing methods for nonsmooth, nonconvex minimization. Math. Programming 134(1):71–99.Crossref, Google Scholar
• [10] Chen X, Womersley R (2018) Spherical designs and nonconvex minimization for recovery of sparse signals on the sphere. SIAM J. Imaging Sci. 11(2):1390–1415.Crossref, Google Scholar
• [11] Chen S, Donoho D, Saunders M (2001) Atomic decomposition by basis pursuit. SIAM Rev. 43(1):129–159.Crossref, Google Scholar
• [12] Chen X, Lu Z, Pong T (2016) Penalty methods for a class of non-Lipschitz optimization problems. SIAM J. Optim. 26(3):1465–1492.Crossref, Google Scholar
• [13] Chen X, Xu F, Ye Y (2010) Lower bound theory of nonzero entries in solutions of ℓ2-ℓp minimization. SIAM J. Sci. Comput. 32(5):2832–2852.Crossref, Google Scholar
• [14] Chen X, Ge D, Wang Z, Ye Y (2014) Complexity of unconstrained ℓ2-ℓp minimization. Math. Programming 143(1-2):371–383.Crossref, Google Scholar
• [15] Cohen A, Dahmen W, DeVore R (2009) Compressed sensing and best k-term approximation. J. Amer. Math. Soc. 22(1):211–231.Crossref, Google Scholar
• [16] Donoho D (2006) Compressed sensing. IEEE Trans. Inform. Theory 52(4):1289–1306.Crossref, Google Scholar
• [17] Donoho D, Huo X (2001) Uncertainty principles and ideal atomic decomposition. IEEE Trans. Inform. Theory 47(7):2845–2862.Crossref, Google Scholar
• [18] Donoho D, Elad M, Temlyakov V (2005) Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Trans. Inform. Theory 52(1):6–18.Crossref, Google Scholar
• [19] Fan J, Li R (2001) Variable selection via nonconcave penalized likelihood and its oracle properties. J. Amer. Statist. Assoc. 96(456):1348–1360.Crossref, Google Scholar
• [20] Foucart S, Lai MJ (2009) Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0<q<1. Appl. Comput. Harmonic Anal. 26(3):395–407.Crossref, Google Scholar
• [21] Ge D, Jiang X, Ye Y (2011) A note on the complexity of Lp minimization. Math. Programming 129(2):285–299.Crossref, Google Scholar
• [22] Gong P, Zhang C, Lu Z, Huang J, Ye J (2013) A general iterative shinkage and thresholding algorithm for non-convex regularized optimization problems. Sanjoy D, David M, eds. Proc. 30th Internat. Conf. Machine Learn., vol. 28 (PMLR, Atlanta), 37–45.Google Scholar
• [23] Hastie T, Tibshirani R, Wainwright M (2015) Statistical Learning with Sparsity: The Lasso and Generalizations (Chapman and Hall/CRC).Crossref, Google Scholar
• [24] Hazewinkel M (2013) Viéte Theorem. Encyclopedia of Mathematics (Springer, Berlin).Google Scholar
• [25] Hiriart-Urruty JB, Lemaréchal C (2001) Fundamentals of Convex Analysis (Springer, Berlin).Crossref, Google Scholar
• [26] Hoffman A (1952) On approximate solutions of systems of linear inequalities. J. Res. National Bureau Standards 49(4):263–265.Crossref, Google Scholar
• [27] Horn R, Johnson C (2012) Matrix Analysis, 2nd ed. (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [28] Le Thi H, Dinh T, Ngai H (2012) Exact penalty and error bounds in dc programming. J. Global Optim. 52(3):509–535.Crossref, Google Scholar
• [29] Liu T, Pong T, Takeda A (2019) A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems. Math. Programming 176(1-2):339–367.Crossref, Google Scholar
• [30] Macdonald I (1995) Symmetric Functions and Hall Polynomials (Oxford University Press, Oxford, UK).Google Scholar
• [31] Peng J, Yue S, Li H (2015) NP/CMP equivalence: A phenomenon hidden among sparsity models ℓ0 minimization and ℓp minimization for information processing. IEEE Trans. Inform. Theory 61(7):4028–4033.Crossref, Google Scholar
• [32] Rockafellar R (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• [33] Rockafellar R, Wets RB (1998) Variational Analysis (Springer, Berlin).Crossref, Google Scholar
• [34] Shen J, Mousavi S (2018) Least sparsity of p-norm based optimization problems with p > 1. SIAM J. Optim. 28(3):2721–2751.Crossref, Google Scholar
• [35] Van Den Berg E, Friedlander M (2008) Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31(2):890–912.Crossref, Google Scholar
• [36] Wang H, Li G, Jiang G (2007) Robust regression shrinkage and consistent variable selection through the LAD-Lasso. J. Bus. Econom. Statist. 25(3):347–355.Crossref, Google Scholar
• [37] Wang L (2013) The L1 penalized LAD estimator for high dimensional linear regression. J. Multivariate Anal. 120:135–151.Crossref, Google Scholar
• [38] Wright S, Nowak R, Figueiredo M (2009) Sparse reconstruction by separable approximation. IEEE Trans. Signal Processing 57(7):2479–2493.Crossref, Google Scholar
• [39] Yang L (2017) Proximal gradient method with extrapolation and line search for a class of nonconvex and nonsmooth problems. Preprint, submitted November 18, https://arxiv.org/abs/1711.06831.Google Scholar
• [40] You G, Huang ZH, Wang Y (2019) The sparsest solution of the union of finite polytopes via its nonconvex relaxation. Math. Methods Oper. Res. 89:485–507.Crossref, Google Scholar
• [41] Zhang Y (2013) Theory of compressive sensing via ℓ1-minimization: A non-RIP analysis and extensions. J. Oper. Res. Soc. China 1(1):79–105.Crossref, Google Scholar
• [42] Zhao YB (2013) RSP-based analysis for sparsest and least ℓ1-norm solutions to underdetermined linear systems. IEEE Trans. Signal Processing 61(22):5777–5788.Crossref, Google Scholar
• [43] Zhao YB, Jiang H, Luo ZQ (2018) Weak stability of ℓ1-minimization methods in sparse data reconstruction. Math. Oper. Res. 44(1):173–195.Google Scholar