{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T12:47:55Z","timestamp":1771505275837,"version":"3.50.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319179957","type":"print"},{"value":"9783319179964","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17996-4_4","type":"book-chapter","created":{"date-parts":[[2015,4,21]],"date-time":"2015-04-21T14:35:44Z","timestamp":1429626944000},"page":"37-48","source":"Crossref","is-referenced-by-count":5,"title":["DC Approximation Approach for \u21130-minimization in Compressed Sensing"],"prefix":"10.1007","author":[{"given":"Thi Bich Thuy","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Hoai An Le","family":"Thi","sequence":"additional","affiliation":[]},{"given":"Hoai Minh","family":"Le","sequence":"additional","affiliation":[]},{"given":"Xuan Thanh","family":"Vo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H. Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-Lojasiewicz inequality. Mathematics of Operations Research\u00a035(2), 438\u2013457 (2010)","journal-title":"Mathematics of Operations Research"},{"key":"4_CR2","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature Selection via concave minimization and support vector machines. In: Proceeding of International Conference on Machina Learning ICML 1998 (1998)"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S. Chen","year":"1998","unstructured":"Chen, S., Donoho, D.L., Saunders, M.: Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing\u00a020(1), 33\u201361 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"12","key":"4_CR4","doi-asserted-by":"publisher","first-page":"5406","DOI":"10.1109\/TIT.2006.885507","volume":"52","author":"E.J. Cand\u00e8s","year":"2006","unstructured":"Cand\u00e8s, E.J., Tao, T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Transaction Information Theory\u00a052(12), 5406\u20135425 (2006)","journal-title":"IEEE Transaction Information Theory"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Wakin, M.B., Boyd, S.: Enhancing Sparsity by Reweighted l1 Minimization. Journal of Fourier Analysis and Applications\u00a014(5), 877\u2013905 (2008); special issue on sparsity","DOI":"10.1007\/s00041-008-9045-x"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Romberg, J., Tao, T.: Robust Uncertainty Principles: Exact Signal Reconstruction From Highly Incomplete Frequency Information (2006)","DOI":"10.1109\/TIT.2005.862083"},{"issue":"7","key":"4_CR7","doi-asserted-by":"publisher","first-page":"2829","DOI":"10.1109\/TIT.2008.924688","volume":"54","author":"E.J. Cand\u00e9s","year":"2008","unstructured":"Cand\u00e9s, E.J., Paige, A.: Randall: Highly Robust Error Correction by Convex Programming. IEEE Transactions Information Theory Information Theory\u00a054(7), 2829\u20132840 (2008)","journal-title":"IEEE Transactions Information Theory Information Theory"},{"issue":"10","key":"4_CR8","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1109\/LSP.2007.898300","volume":"14","author":"R. Chartrand","year":"2007","unstructured":"Chartrand, R.: Exact Reconstruction of Sparse Signals via Nonconvex Minimization. IEEE Signal Process. Lett.\u00a014(10), 707\u2013710 (2007)","journal-title":"IEEE Signal Process. Lett."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively Reweighted Algorithms for Compressive Sensing. In: IEEE International Conference on Acoustics, Speech, and Signal Processing (2008)","DOI":"10.1109\/ICASSP.2008.4518498"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I. Daubechies","year":"2010","unstructured":"Daubechies, I., DeVore, R., Fornasier, M., G\u00fcnt\u00fck, C.: Iteratively reweighted least squares minimization for sparse recovery. Commun. Pure Appl. Math.\u00a063, 1\u201338 (2010)","journal-title":"Commun. Pure Appl. Math."},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D.L. Donoho","year":"2006","unstructured":"Donoho, D.L.: Compressed sensing. IEEE Trans. Inform. Theory\u00a052(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"4_CR12","doi-asserted-by":"publisher","first-page":"2845","DOI":"10.1109\/18.959265","volume":"47","author":"D.L. Donoho","year":"2001","unstructured":"Donoho, D.L., Xiaoming, H.: Uncertainty principles and ideal atomic decomposition. IEEE Transactions on Information Theory\u00a047(7), 2845\u20132862 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"456","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J. Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Amer. Stat. Ass.\u00a096(456), 1348\u20131360 (2001)","journal-title":"J. Amer. Stat. Ass."},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/10618600.1998.10474784","volume":"7","author":"W.J. Fu","year":"1998","unstructured":"Fu, W.J.: Penalized regressions: The bridge versus the Lasso. Journal of Computational and Graphical Statistics\u00a07, 397\u2013416 (1998)","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.acha.2008.09.001","volume":"26","author":"S. Foucart","year":"2009","unstructured":"Foucart, S., Lai, M.: Sparsest solutions of underdetermined linear systems via \u2113 q -minimization for 0\u2009<\u2009q\u2009\u2264\u20091, Appl. Comput. Harmon. Anal.\u00a026, 395\u2013407 (2009)","journal-title":"Comput. Harmon. Anal."},{"issue":"12","key":"4_CR16","doi-asserted-by":"publisher","first-page":"4686","DOI":"10.1109\/TSP.2009.2026004","volume":"57","author":"G. Gasso","year":"2009","unstructured":"Gasso, G., Rakotomamonjy, A., Canu, S.: Recovering sparse signals with a certain family of nonconvex penalties and DC programming. IEEE Transactions on Signal Processing\u00a057(12), 4686\u20134698 (2009)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-74494-8_49","volume-title":"Independent Component Analysis and Signal Separation","author":"G.H. Mohimani","year":"2007","unstructured":"Mohimani, G.H., Babaie-Zadeh, M., Jutten, C.: Fast Sparse Representation Based on Smoothed \u21130 Norm. In: Davies, M.E., James, C.J., Abdallah, S.A., Plumbley, M.D. (eds.) ICA 2007. LNCS, vol.\u00a04666, pp. 389\u2013396. Springer, Heidelberg (2007)"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1109\/TSP.2008.2007606","volume":"57","author":"H. Mohimani","year":"2009","unstructured":"Mohimani, H., Babaie-Zadeh, M., Jutten, C.: A fast approach for overcomplete sparse decomposition based on smoothed L0 norm. IEEE Transactions on Signal Processing\u00a057(1), 289\u2013301 (2009)","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"M.-J. Lai","year":"2013","unstructured":"Lai, M.-J., Xu, Y., Yin, W.: Improved Iteratively reweighted least squares for unconstrained smoothed \u2113 p minimization. SIAM J. Numer. Anal.\u00a051(2), 927\u2013957 (2013)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"4_CR20","first-page":"289","volume":"22","author":"T. Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to DC programming: Theory, algorithms and applications. Acta Math. Vietnamica\u00a022(1), 289\u2013357 (1997)","journal-title":"Acta Math. Vietnamica"},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"H.A. Le Thi","year":"1998","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC Optimization Algorithm for Solving The Trust Region Problem. SIAM Journal on Optimization\u00a08(2), 476\u2013505 (1998)","journal-title":"SIAM Journal on Optimization"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"H.A. Le Thi","year":"2005","unstructured":"Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) Programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals of Operations Research\u00a0133, 23\u201346 (2005)","journal-title":"Annals of Operations Research"},{"key":"4_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-88192-6_8","volume-title":"Advanced Data Mining and Applications","author":"H.A. Le Thi","year":"2008","unstructured":"Le Thi, H.A., Van Nguyen, V., Ouchani, S.: Gene Selection for Cancer Classification Using DCA. In: Tang, C., Ling, C.X., Zhou, X., Cercone, N.J., Li, X. (eds.) ADMA 2008. LNCS (LNAI), vol.\u00a05139, pp. 62\u201372. Springer, Heidelberg (2008)"},{"issue":"3","key":"4_CR24","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11634-008-0030-7","volume":"2","author":"H.A. Le Thi","year":"2008","unstructured":"Le Thi, H.A., Le Hoai, M., Nguyen, V.V., Pham Dinh, T.: A DC Programming approach for feature selection in support vector machines learning. Adv. Data Analysis and Classification\u00a02(3), 259\u2013278 (2008)","journal-title":"Adv. Data Analysis and Classification"},{"key":"4_CR25","unstructured":"Le Thi, H.A.: A new approximation for the \u21130\u2013norm. Research report LITA EA 3097, University of Lorraine, France (2012)"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-36543-0_40","volume-title":"Intelligent Information and Database Systems","author":"H.A. Le Thi","year":"2013","unstructured":"Le Thi, H.A., Nguyen Thi, B.T., Le, H.M.: Sparse signal recovery by difference of convex functions algorithms. In: Selamat, A., Nguyen, N.T., Haron, H. (eds.) ACIIDS 2013, Part II. LNCS, vol.\u00a07803, pp. 387\u2013397. Springer, Heidelberg (2013)"},{"issue":"1","key":"4_CR27","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"244","author":"H.A. Le Thi","year":"2015","unstructured":"Le Thi, H.A., Pham Dinh, T., Le, H.M., Vo, X.T.: DC approximation approaches for sparse optimization. European Journal of Operational Research\u00a0244(1), 26\u201346 (2015)","journal-title":"European Journal of Operational Research"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Le, H.M., Le Thi, H.A., Nguyen, M.C.: Sparse Semi-Supervised Support Vector Machines by DC Programming and DCA. Neurocomputing (November 27, 2014), (published online), doi:10.1016\/j.neucom.2014.11.051,","DOI":"10.1016\/j.neucom.2014.11.051"},{"issue":"12","key":"4_CR29","doi-asserted-by":"publisher","first-page":"2827","DOI":"10.1162\/NECO_a_00673","volume":"26","author":"H.A. Le Thi","year":"2014","unstructured":"Le Thi, H.A., Nguyen, M.C., Pham Dinh, T.: A DC programming approach for finding Communities in networks. Neural Computation\u00a026(12), 2827\u20132854 (2014)","journal-title":"Neural Computation"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.neunet.2014.06.011","volume":"59","author":"H.A. Le Thi","year":"2014","unstructured":"Le Thi, H.A., Vo, X.T., Pham Dinh, T.: Feature Selection for linear SVMs under Uncertain Data: Robust optimization based on Difference of Convex functions Algorithms. Neural Networks\u00a059, 36\u201350 (2014)","journal-title":"Neural Networks"},{"issue":"4","key":"4_CR31","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1080\/10556788.2011.652630","volume":"28","author":"C.S. Ong","year":"2013","unstructured":"Ong, C.S., Le Thi, H.A.: Learning sparse classifiers with difference of convex functions algorithms. Optimization Methods and Software\u00a028(4), 830\u2013854 (2013)","journal-title":"Optimization Methods and Software"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Peleg, D., Meir, R.: A bilinear formulation for vector sparsity optimization. Signal Processing\u00a088(2), 375\u2013389 (2008) ISSN 0165\u20131684","DOI":"10.1016\/j.sigpro.2007.08.015"},{"issue":"6","key":"4_CR33","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1080\/10556788.2010.511668","volume":"26","author":"F. Rinaldi","year":"2011","unstructured":"Rinaldi, F.: Concave programming for finding sparse solutions to problems with convex constraints. Optimization Methods and Software\u00a026(6), 971\u2013992 (2011)","journal-title":"Optimization Methods and Software"},{"issue":"3","key":"4_CR34","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10589-008-9202-9","volume":"46","author":"F. Rinaldi","year":"2010","unstructured":"Rinaldi, F., Schoen, F., Sciandrone, M.: Concave programming for minimizing the zero-norm over polyhedral sets. Comput. Opt. Appl.\u00a046(3), 467\u2013486 (2010)","journal-title":"Comput. Opt. Appl."},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/78.738251","volume":"47","author":"B.D. Rao","year":"1999","unstructured":"Rao, B.D., Kreutz-Delgado, K.: An affine scaling methodology for best basis selection. IEEE Trans. Signal Processing\u00a047, 87\u2013200 (1999)","journal-title":"IEEE Trans. Signal Processing"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Thiao, M., Pham Dinh, T., Le Thi, H.A.: DC Programming Approach for a Class of Nonconvex Programs Involving lo Norm. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds.) MCO 2008. CCIS, vol.\u00a014, pp. 348\u2013357. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-87477-5_38"},{"key":"4_CR37","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1214\/08-AOS659","volume":"37","author":"T. Zhang","year":"2009","unstructured":"Zhang, T.: Some sharp performance bounds for least squares regression with regularization. Ann. Statist.\u00a037, 2109\u20132144 (2009)","journal-title":"Ann. Statist."},{"issue":"7-8","key":"4_CR38","doi-asserted-by":"publisher","first-page":"2159","DOI":"10.1007\/s00521-012-1166-0","volume":"23","author":"C. Zhang","year":"2013","unstructured":"Zhang, C., Shao, Y., Tan, J., Deng, N.: Mixed-norm linear support vector machine. Neural Computing and Applications\u00a023(7-8), 2159\u20132166 (2013)","journal-title":"Neural Computing and Applications"},{"issue":"3","key":"4_CR39","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/110847445","volume":"22","author":"Y. Zhao","year":"2012","unstructured":"Zhao, Y., Li, D.: Reweighted l1-Minimization for Sparse Solutions to Underdetermined Linear Systems. SIAM J. Opt.\u00a022(3), 1065\u20131088 (2012)","journal-title":"SIAM J. Opt."},{"key":"4_CR40","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1198\/016214506000000735","volume":"101","author":"H. Zou","year":"2006","unstructured":"Zou, H.: The adaptive lasso and its oracle properties. J. Amer. Stat. Ass.\u00a0101, 1418\u20131429 (2006)","journal-title":"J. Amer. Stat. Ass."},{"issue":"4","key":"4_CR41","doi-asserted-by":"publisher","first-page":"1509","DOI":"10.1214\/009053607000000802","volume":"36","author":"H. Zou","year":"2008","unstructured":"Zou, H., Li, R.: One-step sparse estimates in nonconcave penalized likelihood models. The Annals of Statistics\u00a036(4), 1509\u20131533 (2008)","journal-title":"The Annals of Statistics"}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17996-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T14:28:51Z","timestamp":1717856931000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17996-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319179957","9783319179964"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17996-4_4","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}