{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T16:32:55Z","timestamp":1768321975454,"version":"3.49.0"},"reference-count":161,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:00:00Z","timestamp":1676419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:00:00Z","timestamp":1676419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10898-023-01272-1","type":"journal-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T06:49:42Z","timestamp":1676616582000},"page":"533-590","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Open issues and recent advances in DC programming and DCA"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2239-2100","authenticated-orcid":false,"given":"Hoai An","family":"Le Thi","sequence":"first","affiliation":[]},{"given":"Tao","family":"Pham Dinh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,15]]},"reference":[{"issue":"1","key":"1272_CR1","first-page":"23","volume":"133","author":"HA 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. Ann. Oper. Res. 133(1), 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1272_CR2","first-page":"5","volume":"169","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC programming and DCA: thirty years of developments. Math. Program. Special Issue DC Program. Theory Algorithms Appl. 169(1), 5\u201368 (2018)","journal-title":"Math. Program. Special Issue DC Program. Theory Algorithms Appl."},{"issue":"2","key":"1272_CR3","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: D.C. optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"1272_CR4","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Transactions on Computational Intelligence XIII","author":"T Pham Dinh","year":"2014","unstructured":"Pham Dinh, T., Le Thi, H.A.: Recent advances in DC programming and DCA. In: Nguyen, N.-T., Le-Thi, H. (eds.) Transactions on Computational Intelligence XIII. Lecture Notes in Computer Science, vol. 8342, pp. 1\u201337. Springer, Berlin (2014)"},{"issue":"1","key":"1272_CR5","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithm and applications. Acta Math. Vietnam 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam"},{"issue":"3","key":"1272_CR6","doi-asserted-by":"crossref","first-page":"707","DOI":"10.2140\/pjm.1959.9.707","volume":"9","author":"P Hartman","year":"1959","unstructured":"Hartman, P.: On functions representable as a difference of convex functions. Pac. J. Math. 9(3), 707\u2013713 (1959)","journal-title":"Pac. J. Math."},{"key":"1272_CR7","first-page":"249","volume-title":"Fermat Days 85: Mathematics for Optimization. North-Holland Mathematics Studies","author":"T Pham Dinh","year":"1986","unstructured":"Pham Dinh, T., Souad, E.B.: Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients. In: Hiriart-Urruty, J.-B. (ed.) Fermat Days 85: Mathematics for Optimization. North-Holland Mathematics Studies, vol. 129, pp. 249\u2013271. North-Holland, Amsterdam (1986)"},{"key":"1272_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Heidelberg (1996)","edition":"3"},{"key":"1272_CR9","volume-title":"Introduction to Global Optimization","author":"R Horst","year":"1995","unstructured":"Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Springer, New York (1995)"},{"issue":"1","key":"1272_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R Horst","year":"1999","unstructured":"Horst, R., Thoai, N.V.: DC programming: overview. J. Optim. Theory Appl. 103(1), 1\u201343 (1999)","journal-title":"J. Optim. Theory Appl."},{"key":"1272_CR11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10957-018-1345-y","volume":"179","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: Convergence analysis of DCA with subanalytic data. J. Optim. Theory Appl. 179, 103\u2013126 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1272_CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1287\/moor.2016.0795","volume":"42","author":"J-S Pang","year":"2017","unstructured":"Pang, J.-S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1), 95\u2013118 (2017)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1272_CR13","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/s10898-011-9765-3","volume":"52","author":"HA Le Thi","year":"2012","unstructured":"Le Thi, H.A., Pham Dinh, T., Huynh, V.N.: Exact penalty and error bounds in DC programming. J. Global Optim. 52(3), 509\u2013535 (2012)","journal-title":"J. Global Optim."},{"issue":"1","key":"1272_CR14","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/s10957-016-0967-1","volume":"171","author":"HA Le Thi","year":"2016","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: Error bounds via exact penalization with applications to concave and quadratic systems. J. Optim. Theory Appl. 171(1), 228\u2013250 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"1272_CR15","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s101070050003","volume":"87","author":"HA Le Thi","year":"2000","unstructured":"Le Thi, H.A.: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints. Math. Program. 87, 401\u2013426 (2000)","journal-title":"Math. Program."},{"key":"1272_CR16","unstructured":"Le Thi, H.A., Phan, D.N., Pham Dinh, T.: Advanced Difference of Convex functions Algorithms for Nonconvex Programming (submitted) (2021)"},{"key":"1272_CR17","unstructured":"Le Thi, H.A., Phan, D.N., Pham Dinh, T.: Extended DCA based Algorithms for Nonconvex Programming (submitted) (2021)"},{"key":"1272_CR18","volume-title":"Introduction to Optimization","author":"B Polyak","year":"1987","unstructured":"Polyak, B.: Introduction to Optimization. Optimization Software Inc, New York (1987)"},{"key":"1272_CR19","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/83.661182","volume":"7","author":"A Chambolle","year":"1998","unstructured":"Chambolle, A., Devore, R.A., Lee, N.Y., Lucier, B.J.: Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage. IEEETrans Image Process 7, 319\u2013335 (1998)","journal-title":"IEEETrans Image Process"},{"key":"1272_CR20","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Elsevier, San Diego (1970)"},{"key":"1272_CR21","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Proceedings of the 15th International Conference on Machine Learning, pp. 82\u201390. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1998)"},{"issue":"4","key":"1272_CR22","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"AL Yuille","year":"2003","unstructured":"Yuille, A.L., Rangarajan, A.: The concave-convex procedure. Neural Comput. 15(4), 915\u2013936 (2003)","journal-title":"Neural Comput."},{"issue":"1","key":"1272_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. B Met. 39(1), 1\u201338 (1977)","journal-title":"J. R. Stat. Soc. B Met."},{"key":"1272_CR24","first-page":"451","volume":"21","author":"W Sun","year":"2003","unstructured":"Sun, W., Sampaio, R.J.B., Candido, M.A.B.: Proximal point algorithm for minimization of DC function. J. Comput. Math. 21, 451\u2013462 (2003)","journal-title":"J. Comput. Math."},{"key":"1272_CR25","unstructured":"Razaviyayn, M.: Successive convex approximation: analysis and applications. Ph.D. thesis, University of Minnesota (2014)"},{"key":"1272_CR26","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.-Q., Pang, J.S.: Parallel successive convex approximation for nonsmooth nonconvex optimization. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N.d., Weinberger, K. (eds.) Advances in Neural Information Processing Systems 27, pp. 1440\u20131448. Curran Associates, Inc., Montreal (2014)"},{"issue":"3","key":"1272_CR27","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1109\/TSP.2013.2293126","volume":"62","author":"G Scutari","year":"2014","unstructured":"Scutari, G., Facchinei, F., Song, P., Palomar, D.P., Pang, J.S.: Decomposition by partial linearization: parallel optimization of multi-agent systems. IEEE Trans. Signal Process. 62(3), 641\u2013656 (2014)","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"1272_CR28","doi-asserted-by":"crossref","first-page":"1929","DOI":"10.1109\/TSP.2016.2637317","volume":"65","author":"G Scutari","year":"2017","unstructured":"Scutari, G., Facchinei, F., Lampariello, L.: Parallel and distributed methods for constrained nonconvex optimization-part I: theory. IEEE Trans. Signal Process. 65(8), 1929\u20131944 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"1272_CR29","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/TSP.2016.2637314","volume":"65","author":"G Scutari","year":"2017","unstructured":"Scutari, G., Facchinei, F., Lampariello, L., Sardellitti, S., Song, P.: Parallel and distributed methods for constrained nonconvex optimization-part II: applications in communications and machine learning. IEEE Trans. Signal Process. 65(8), 1945\u20131960 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"1272_CR30","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.-Q.: A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J. Optim. 23(2), 1126\u20131153 (2013)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1272_CR31","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"1272_CR32","unstructured":"Gong, P., Zhang, C., Lu, Z., Huang, J.Z., Ye, J.: A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems. In: Proceedings of the 30th International Conference on International Conference on Machine Learning, vol. 28. Atlanta, GA, USA, pp. 37\u201345 (2013)"},{"issue":"3","key":"1272_CR33","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1109\/TNNLS.2015.2418224","volume":"27","author":"A Rakotomamonjy","year":"2016","unstructured":"Rakotomamonjy, A., Flamary, R., Gasso, G.: Dc proximal newton for nonconvex optimization problems. IEEE Trans. Neural Netw. Learn. Syst. 27(3), 636\u2013647 (2016)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"1272_CR34","doi-asserted-by":"crossref","unstructured":"Le, H.M., Ta, M.T.: DC programming and DCA for solving minimum sum-of-squares clustering using weighted dissimilarity measures. In: Transactions on Computational Intelligence XIII. LNCS, vol. 8342, pp. 113\u2013131. Springer, Berlin (2014)","DOI":"10.1007\/978-3-642-54455-2_5"},{"key":"1272_CR35","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-319-06569-4_2","volume-title":"Advanced Computational Methods for Knowledge Engineering","author":"HA Le Thi","year":"2014","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: DC programming and DCA for general DC programs. In: van Do, T., Le Thi, H.A., Nguyen, N.T. (eds.) Advanced Computational Methods for Knowledge Engineering, pp. 15\u201335. Springer, Cham (2014)"},{"issue":"1","key":"1272_CR36","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/moor.1030.0069","volume":"29","author":"MV Solodov","year":"2004","unstructured":"Solodov, M.V.: On the sequential quadratically constrained quadratic programming methods. Math. Oper. Res. 29(1), 64\u201379 (2004)","journal-title":"Math. Oper. Res."},{"key":"1272_CR37","first-page":"1","volume":"409","author":"HA Le Thi","year":"2021","unstructured":"Le Thi, H.A., Le, H.M., Phan, D.N., Tran, B.: Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning. Appl. Math. Comput. 409, 1\u201322 (2021)","journal-title":"Appl. Math. Comput."},{"key":"1272_CR38","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$\\cal{O} (1\/k^2)$$. Sov. Math. Dokl. 27, 372\u2013376 (1983)","journal-title":"Sov. Math. Dokl."},{"key":"1272_CR39","doi-asserted-by":"crossref","unstructured":"Phan, D.N., Le, H.M., Le Thi, H.A.: Accelerated difference of convex functions algorithm and its application to sparse binary logistic regression. In: 27th International Joint Conference on Artificial Intelligence and 23rd European Conference on Artificial Intelligence (IJCAI-ECAI 2018), Stockholm, Sweden, pp. 1369\u20131375 (2018)","DOI":"10.24963\/ijcai.2018\/190"},{"issue":"2","key":"1272_CR40","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1020587701058","volume":"23","author":"L Grippo","year":"2002","unstructured":"Grippo, L., Sciandrone, M.: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method. Comput. Optim. Appl. 23(2), 143\u2013169 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"7","key":"1272_CR41","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"1272_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"4","key":"1272_CR43","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1007\/s11228-018-0497-0","volume":"27","author":"W de Oliveira","year":"2019","unstructured":"de Oliveira, W., Tcheou, M.P.: An inertial algorithm for dc programming. Set-Valued Var. Anal. 27(4), 895\u2013919 (2019)","journal-title":"Set-Valued Var. Anal."},{"key":"1272_CR44","unstructured":"Phan, D.N., Le Thi, H.A.: DCA based Algorithm with Extrapolation for Nonconvex Nonsmooth Optimization (Submitted) (2021)"},{"key":"1272_CR45","doi-asserted-by":"crossref","unstructured":"Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12(8) (1981)","DOI":"10.1080\/00207728108963798"},{"key":"1272_CR46","doi-asserted-by":"crossref","unstructured":"Arag\u00f3n Artacho, F., Fleming, R.M.T., Phan, T.V.: Accelerating the DC algorithm for smooth functions. Math. Program. 169(1), 95\u2013118 (2018)","DOI":"10.1007\/s10107-017-1180-1"},{"issue":"1","key":"1272_CR47","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1137\/18M123339X","volume":"30","author":"FJ Arag\u00f3n Artacho","year":"2020","unstructured":"Arag\u00f3n Artacho, F.J., Phan, T.V.: The boosted difference of convex functions algorithm for nonsmooth functions. SIAM J. Optim. 30(1), 980\u20131006 (2020)","journal-title":"SIAM J. Optim."},{"key":"1272_CR48","unstructured":"Niu, Y.-S., Wang, Y.-J., Le Thi, H.A., Pham Dinh, T.: Higher-order Moment Portfolio Optimization via The Difference-of-Convex Programming and Sums-of-Squares (submitted) (2021)"},{"key":"1272_CR49","unstructured":"Le Thi, H.A., Vu, V.H.K.: Accelerated Difference of Convex functions Algorithms: a comparative study on two approaches and applications in Machine Learning. Technical report, University of Lorraine (2021)"},{"key":"1272_CR50","unstructured":"Le Thi, H.A., Pham Dinh, T.: D.C. programming approach to the multidimensional scaling problem. In: Migdalas, A., Pardalos, P.M., V\u00e4rbrand, P. (eds.) From Local to Global Optimization, pp. 231\u2013276. Springer, Boston (2001)"},{"key":"1272_CR51","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: Advances in Neural Information Processing Systems, pp. 377\u2013387 (2015)"},{"key":"1272_CR52","doi-asserted-by":"crossref","unstructured":"Yao, Q., Kwok, J.T., Gao, F., Chen, W., Liu, T.Y.: Efficient inexact proximal gradient algorithm for nonconvex problems. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, pp. 3308\u20133314 (2017)","DOI":"10.24963\/ijcai.2017\/462"},{"issue":"2","key":"1272_CR53","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10589-017-9954-1","volume":"69","author":"B Wen","year":"2018","unstructured":"Wen, B., Chen, X., Pong, T.K.: A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69(2), 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"1272_CR54","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10107-018-1318-9","volume":"176","author":"Z Lu","year":"2019","unstructured":"Lu, Z., Zhou, Z., Sun, Z.: Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization. Math. Program. 176(1), 369\u2013401 (2019)","journal-title":"Math. Program."},{"key":"1272_CR55","doi-asserted-by":"crossref","first-page":"2725","DOI":"10.1137\/18M1214342","volume":"29","author":"Z Lu","year":"2019","unstructured":"Lu, Z., Zhou, Z.: Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming. SIAM J. Optim. 29, 2725\u20132752 (2019)","journal-title":"SIAM J. Optim."},{"key":"1272_CR56","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10589-019-00081-1","volume":"73","author":"P Yu","year":"2019","unstructured":"Yu, P., Pong, T.K.: Iteratively reweighted $$\\ell _1$$ algorithms with extrapolation. Comput. Optim. Appl. 73, 353\u2013386 (2019)","journal-title":"Comput. Optim. Appl."},{"issue":"11","key":"1272_CR57","doi-asserted-by":"crossref","first-page":"2255","DOI":"10.1109\/TASL.2013.2271592","volume":"21","author":"T Tsiligkaridis","year":"2013","unstructured":"Tsiligkaridis, T., Marcheret, E., Goel, V.: A difference of convex functions approach to large-scale log-linear model estimation. IEEE Trans. Audio Speech Lang. Process. 21(11), 2255\u20132266 (2013)","journal-title":"IEEE Trans. Audio Speech Lang. Process."},{"issue":"1","key":"1272_CR58","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch, H., Bolte, J., Svaiter, B.F.: Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"1272_CR59","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Image Sci. 2, 183\u2013202 (2009)","journal-title":"SIAM J. Image Sci."},{"key":"1272_CR60","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10957-019-01500-3","volume":"182","author":"W Ackooij","year":"2019","unstructured":"Ackooij, W., de Oliveira, W.: Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions. J. Optim. Theory Appl. 182, 49\u201380 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"1272_CR61","unstructured":"Le Thi, H.A., Phan, D.N., Le, H.M.: DCA-Like and its accelerated scheme for a class of structured Nonconvex Optimization Problems (Submitted) (2021)"},{"issue":"3","key":"1272_CR62","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"HA Le Thi","year":"1997","unstructured":"Le Thi, H.A., Pham Dinh, T.: Solving a class of linearly constrained indefinite quadratic problems by D.C. algorithms. J. Global Optim. 11(3), 253\u2013285 (1997)","journal-title":"J. Global Optim."},{"issue":"4","key":"1272_CR63","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10898-009-9507-y","volume":"48","author":"T Pham Dinh","year":"2010","unstructured":"Pham Dinh, T., Nguyen Canh, N., Le Thi, H.A.: An efficient combination of DCA and B &B using DC\/SDP relaxation for globally solving binary quadratic programs. J. Global Optim. 48(4), 595\u2013632 (2010)","journal-title":"J. Global Optim."},{"key":"1272_CR64","volume-title":"Convex Analysis and Minimization Algorithms, Parts I & II","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms, Parts I & II. Springer, Berlin (1993)"},{"key":"1272_CR65","volume-title":"Convex Analysis. Princeton Mathematical Series","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton Mathematical Series. Princeton University Press, Princeton (1970)"},{"issue":"4","key":"1272_CR66","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1162\/neco_a_01266","volume":"32","author":"HA Le Thi","year":"2020","unstructured":"Le Thi, H.A., Ho, V.T.: Online learning based on online DCA and application to online classification. Neural Comput. 32(4), 759\u2013793 (2020)","journal-title":"Neural Comput."},{"key":"1272_CR67","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-differentiable Functions","author":"NZ Shor","year":"1985","unstructured":"Shor, N.Z.: Minimization Methods for Non-differentiable Functions. Springer, Berlin (1985)"},{"key":"1272_CR68","unstructured":"Le Thi, H.A., Le, H.M., Phan, D.N., Tran, B.: Stochastic DCA for the large-sum of non-convex functions problem and its application to group variable selection in classification. In: Precup, D., Teh, Y.W. (eds.) Proceedings of the 34th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 70, pp. 3394\u20133403. PMLR, Sydney, NSW, Australia (2017)"},{"issue":"1\u20132","key":"1272_CR69","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1\u20132), 83\u2013112 (2017)","journal-title":"Math. Program."},{"key":"1272_CR70","unstructured":"Le\u00a0Thi, H.A., Luu, H.P.H., Le, H.M., Pham\u00a0Dinh, T.: Stochastic DCA with variance reduction and applications in machine learning. J. Mach. Learn. Res. 23(206), 1\u201344 (2022)"},{"issue":"3","key":"1272_CR71","doi-asserted-by":"crossref","first-page":"2530","DOI":"10.1137\/19M1276819","volume":"30","author":"J Liu","year":"2020","unstructured":"Liu, J., Cui, Y., Pang, J.S., Sen, S.: Two-stage stochastic programming with linearly bi-parameterized quadratic recourse. SIAM J. Optim. 30(3), 2530\u20132558 (2020)","journal-title":"SIAM J. Optim."},{"key":"1272_CR72","unstructured":"Nitanda, A., Suzuki, T.: Stochastic Difference of convex algorithm and its application to training deep boltzmann machines. In: Singh, A., Zhu, J. (eds.) Proceedings of the 20th International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 54, pp. 470\u2013478. PMLR, Florida, USA (2017)"},{"key":"1272_CR73","unstructured":"Xu, Y., Qi, Q., Lin, Q., Jin, R., Yang, T.: Stochastic optimization for DC functions and non-smooth non-convex regularizers with non-asymptotic convergence. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 97, pp. 6942\u20136951. PMLR, California, USA (2019)"},{"issue":"61","key":"1272_CR74","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12(61), 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"1272_CR75","doi-asserted-by":"crossref","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., Zhang, T.: A proximal stochastic gradient method with progressive variance reduction. SIAM J. Optim. 24(4), 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"key":"1272_CR76","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T., Luu, H.P.H.: Stochastic difference-of-convex algorithms for solving nonconvex optimization problems. SIAM J. Optim. 32(3), 2263\u20132293 (2022)","DOI":"10.1137\/20M1385706"},{"key":"1272_CR77","unstructured":"Le Thi, H.A., Pham Dinh, T., Luu, H.P.H., Le, H.M.: Deterministic and stochastic DCA for DC programming. In: Handbook of Engineering Statistics, 2nd edn. Springer, Cham (2021) (in press)"},{"key":"1272_CR78","unstructured":"Le Thi, H.A., Luu, H.P.H., Pham Dinh, T.: Online stochastic DCA with applications to principal component analysis. IEEE Trans. Neural Netw. Learn. Syst. (in press) (2022)"},{"issue":"1\u20132","key":"1272_CR79","first-page":"93","volume":"50","author":"HA Le Thi","year":"2001","unstructured":"Le Thi, H.A., Pham Dinh, T.: A continuous approach for globally solving linearly constrained quadratic zero-one programming problems. Optimization 50(1\u20132), 93\u2013120 (2001)","journal-title":"Optimization"},{"issue":"3","key":"1272_CR80","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10898-008-9325-7","volume":"44","author":"HA Le Thi","year":"2009","unstructured":"Le Thi, H.A., Pham Dinh, T., Thoai, N.V., Nguyen Canh, N.: D.C. optimization techniques for solving a class of nonlinear bilevel programs. J. Global Optim. 44(3), 313\u2013337 (2009)","journal-title":"J. Global Optim."},{"issue":"3","key":"1272_CR81","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0167-6377(96)00022-3","volume":"19","author":"HA Le Thi","year":"1996","unstructured":"Le Thi, H.A., Pham Dinh, T., Le, D.M.: Numerical solution for optimization over the efficient set by DC optimization algorithms. Oper. Res. Lett. 19(3), 117\u2013128 (1996)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1272_CR82","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1023\/A:1023993504522","volume":"117","author":"HA Le Thi","year":"2003","unstructured":"Le Thi, H.A., Pham Dinh, T., Muu, L.D.: Simplicially constrained D.C. optimization over the efficient and weakly efficient sets. J. Optim. Theory Appl. 117(3), 503\u2013521 (2003)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1272_CR83","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S0377-2217(01)00301-0","volume":"142","author":"HA Le Thi","year":"2002","unstructured":"Le Thi, H.A., Pham Dinh, T., Thoai, N.V.: Combination between global and local methods for solving an optimization problem over the efficient set. Eur. J. Oper. Res. 142(2), 258\u2013270 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1272_CR84","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.ejor.2014.11.031","volume":"244","author":"HA Le Thi","year":"2015","unstructured":"Le Thi, H.A., Pham Dinh, T., Le, H.M., Vo, X.T.: DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1), 26\u201346 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1272_CR85","first-page":"39","volume":"34","author":"R Ge","year":"1989","unstructured":"Ge, R., Huang, C.: A continuous approach to nonlinear integer programming. Appl. Math. Comput. 34(1), 39\u201360 (1989)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"1272_CR86","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s11590-015-0931-2","volume":"10","author":"T Pham Dinh","year":"2016","unstructured":"Pham Dinh, T., Le Thi, H.A., Pham, V.N., Niu, Y.-S.: DC programming approaches for discrete portfolio optimization under concave transaction costs. Optim. Lett. 10(2), 261\u2013282 (2016)","journal-title":"Optim. Lett."},{"issue":"3","key":"1272_CR87","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s11634-008-0030-7","volume":"2","author":"HA Le Thi","year":"2008","unstructured":"Le Thi, H.A., Le, H.M., Nguyen, V.V., Pham Dinh, T.: A DC programming approach for feature selection in support vector machines learning. J. Adv. Data Anal. Classif. 2(3), 259\u2013278 (2008)","journal-title":"J. Adv. Data Anal. Classif."},{"issue":"6","key":"1272_CR88","first-page":"612","volume":"3","author":"HA Le Thi","year":"2009","unstructured":"Le Thi, H.A., Nguyen, V.V., Ouchani, S.: Gene selection for cancer classification using DCA. J. Front. Comput. Sci. Technol. 3(6), 612\u2013620 (2009)","journal-title":"J. Front. Comput. Sci. Technol."},{"issue":"4","key":"1272_CR89","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1080\/10556788.2011.652630","volume":"28","author":"CS Ong","year":"2013","unstructured":"Ong, C.S., Le Thi, H.A.: Learning sparse classifiers with difference of convex functions algorithms. Optim. Methods Softw. 28(4), 830\u2013854 (2013)","journal-title":"Optim. Methods Softw."},{"key":"1272_CR90","unstructured":"Thiao, M., Pham Dinh, T., Le Thi, H.A.: A DC programming approach for sparse eigenvalue problem. In: F\u00fcrnkranz, J., Joachims, T. (eds.) Proceedings of the 27th International Conference on Machine Learning, pp. 1063\u20131070. Omnipress, Haifa, Israel (2010)"},{"issue":"1\u20133","key":"1272_CR91","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10994-014-5455-y","volume":"101","author":"HA Le Thi","year":"2015","unstructured":"Le Thi, H.A., Le, H.M., Pham Dinh, T.: Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm. Mach. Learn. 101(1\u20133), 163\u2013186 (2015)","journal-title":"Mach. Learn."},{"issue":"2","key":"1272_CR92","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10489-016-0778-y","volume":"45","author":"HA Le Thi","year":"2016","unstructured":"Le Thi, H.A., Pham Dinh, T., Thiao, M.: Efficient approaches for $$\\ell _2-\\ell _0$$ regularization and applications to feature selection in SVM. Appl. Intell. 45(2), 549\u2013565 (2016)","journal-title":"Appl. Intell."},{"key":"1272_CR93","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.neucom.2021.09.039","volume":"466","author":"HA Le Thi","year":"2021","unstructured":"Le Thi, H.A., Phan, D.N., Pham Dinh, T.: DCA based approaches for bi-level variable selection and application for estimate multiple sparse covariance matrices. Neurocomputing 466, 162\u2013177 (2021)","journal-title":"Neurocomputing"},{"key":"1272_CR94","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.neunet.2019.05.011","volume":"118","author":"DN Phan","year":"2019","unstructured":"Phan, D.N., Le Thi, H.A.: Group variable selection via $$\\ell _{p,0}$$ regularization and application to optimal scoring. Neural Netw. 118, 220\u2013234 (2019)","journal-title":"Neural Netw."},{"issue":"4","key":"1272_CR95","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1007\/s10898-021-01043-w","volume":"82","author":"T Pham Dinh","year":"2022","unstructured":"Pham Dinh, T., Huynh, V.N., Le Thi, H.A., Ho, V.T.: Alternating DC algorithm for partial DC programming problems. J. Global Optim. 82(4), 897\u2013928 (2022)","journal-title":"J. Global Optim."},{"key":"1272_CR96","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: Minimizing compositions of differences-of-convex functions with smooth mappings. Math. Oper. Res. (2023) (Minor revision)","DOI":"10.1287\/moor.2021.0258"},{"issue":"4","key":"1272_CR97","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/s10898-006-9066-4","volume":"37","author":"HA Le Thi","year":"2007","unstructured":"Le Thi, H.A., Belghiti, M.T., Pham Dinh, T.: A new efficient algorithm based on DC programming and DCA for clustering. J. Global Optim. 37(4), 593\u2013608 (2007)","journal-title":"J. Global Optim."},{"issue":"1","key":"1272_CR98","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/j.patcog.2013.07.012","volume":"47","author":"HA Le Thi","year":"2014","unstructured":"Le Thi, H.A., Le, H.M., Pham Dinh, T.: New and efficient DCA based algorithms for minimum sum-of-squares clustering. Pattern Recogn. 47(1), 388\u2013401 (2014)","journal-title":"Pattern Recogn."},{"key":"1272_CR99","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-0450-1","volume-title":"Pattern Recognition with Fuzzy Objective Function Algorithms","author":"JC Bezdek","year":"1981","unstructured":"Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algorithms. Kluwer Academic Publishers, Norwell (1981)"},{"issue":"2","key":"1272_CR100","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s11634-007-0011-2","volume":"1","author":"HA Le Thi","year":"2007","unstructured":"Le Thi, H.A., Le, H.M., Pham Dinh, T.: Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms. Adv. Data Anal. Classif. 1(2), 85\u2013104 (2007)","journal-title":"Adv. Data Anal. Classif."},{"key":"1272_CR101","doi-asserted-by":"crossref","unstructured":"Le, H.M., Nguyen, T.B.T., Ta, M.T., Le Thi, H.A.: Image segmentation via feature weighted fuzzy clustering by a DCA based algorithm. In: Advanced Computational Methods for Knowledge Engineering. Studies in Computational Intelligence, vol. 479, pp. 53\u201363. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-319-00293-4_5"},{"issue":"10","key":"1272_CR102","doi-asserted-by":"crossref","first-page":"2776","DOI":"10.1162\/NECO_a_00490","volume":"25","author":"HM Le","year":"2013","unstructured":"Le, H.M., Le Thi, H.A., Pham Dinh, T., Huynh, V.N.: Block clustering based on difference of convex functions (DC) programming and DC algorithms. Neural Comput. 25(10), 2776\u20132807 (2013)","journal-title":"Neural Comput."},{"issue":"3","key":"1272_CR103","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1016\/j.ejor.2005.07.028","volume":"183","author":"HA Le Thi","year":"2007","unstructured":"Le Thi, H.A., Pham Dinh, T., Huynh, V.N.: Optimization based DC programming and DCA for hierarchical clustering. Eur. J. Oper. Res. 183(3), 1067\u20131085 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"1272_CR104","unstructured":"Le Thi, H.A., Le, H.M., Nguyen, V.A.: DCA-like for GMM clsutering with sparse regularization (submitted) (2021)"},{"key":"1272_CR105","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/978-3-030-41964-6_35","volume-title":"Intelligent Information and Database Systems","author":"VA Nguyen","year":"2020","unstructured":"Nguyen, V.A., Le Thi, H.A., Le, H.M.: A DCA based algorithm for feature selection in model-based clustering. In: Nguyen, N.T., Jearanaitanakij, K., Selamat, A., Trawi\u0144ski, B., Chittayasothorn, S. (eds.) Intelligent Information and Database Systems, pp. 404\u2013415. Springer, Cham (2020)"},{"issue":"2","key":"1272_CR106","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes, U., Delling, D., Gaertler, M., Gorke, R., Hoefer, M., Nikoloski, Z., Wagner, D.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172\u2013188 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"12","key":"1272_CR107","doi-asserted-by":"crossref","first-page":"2827","DOI":"10.1162\/NECO_a_00673","volume":"26","author":"HA 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 Comput. 26(12), 2827\u20132854 (2014)","journal-title":"Neural Comput."},{"issue":"5\u20136","key":"1272_CR108","doi-asserted-by":"crossref","first-page":"1336","DOI":"10.1007\/s10618-014-0369-7","volume":"28","author":"HA Le Thi","year":"2014","unstructured":"Le Thi, H.A., Nguyen, M.C.: Self-organizing maps by difference of convex functions optimization. Data Min. Knowl. Disc. 28(5\u20136), 1336\u20131365 (2014)","journal-title":"Data Min. Knowl. Disc."},{"issue":"6","key":"1272_CR109","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1162\/NECO_a_00836","volume":"28","author":"HA Le Thi","year":"2016","unstructured":"Le Thi, H.A., Vo, X.T., Pham Dinh, T.: Efficient nonnegative matrix factorization by DC programming and DCA. Neural Comput. 28(6), 1163\u20131216 (2016)","journal-title":"Neural Comput."},{"issue":"Nov","key":"1272_CR110","first-page":"2579","volume":"9","author":"L van der Maaten","year":"2008","unstructured":"van der Maaten, L., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9(Nov), 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"1272_CR111","unstructured":"Yang, Z., Peltonen, J., Kaski, S.: Majorization-Minimization for Manifold Embedding. In: Lebanon, G., Vishwanathan, S.V.N. (eds.) Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 38, pp. 1088\u20131097. PMLR, San Diego, California (2015)"},{"key":"1272_CR112","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10994-005-1505-9","volume":"61","author":"J Neumann","year":"2005","unstructured":"Neumann, J., Schnorr, G., Steidl, G.: Combined SVM-based feature selection and classification. Mach. Learn. 61, 129\u2013150 (2005)","journal-title":"Mach. Learn."},{"key":"1272_CR113","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Machine Learning Proceedings of the Fifteenth International Conference, pp. 82\u201390. Morgan Kaufmann Publishers Inc., San Francisco (1998)"},{"key":"1272_CR114","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Ho, V.T.: DCA for Gaussian kernel support vector machines with feature selection. In: Modelling. Computation and Optimization in Information Systems and Management Sciences, pp. 223\u2013234. Springer, Cham (2022)","DOI":"10.1007\/978-3-030-92666-3_19"},{"key":"1272_CR115","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.neucom.2014.11.051","volume":"153","author":"HM Le","year":"2015","unstructured":"Le, H.M., Le Thi, H.A., Nguyen, M.C.: Sparse semi-supervised support vector machines by DC programming and DCA. Neurocomputing 153, 62\u201376 (2015)","journal-title":"Neurocomputing"},{"issue":"1","key":"1272_CR116","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10479-016-2333-y","volume":"249","author":"HA Le Thi","year":"2017","unstructured":"Le Thi, H.A., Nguyen, M.C.: DCA based algorithms for feature selection in multi-class support vector machine. Ann. Oper. Res. 249(1), 273\u2013300 (2017)","journal-title":"Ann. Oper. Res."},{"issue":"9","key":"1272_CR117","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1007\/s00521-016-2216-9","volume":"28","author":"HA Le Thi","year":"2016","unstructured":"Le Thi, H.A., Phan, D.N.: DC programming and DCA for sparse Fisher linear discriminant analysis. Neural Comput. Appl. 28(9), 2809\u20132822 (2016)","journal-title":"Neural Comput. Appl."},{"key":"1272_CR118","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.neucom.2015.12.068","volume":"186","author":"HA Le Thi","year":"2016","unstructured":"Le Thi, H.A., Phan, D.N.: DC programming and DCA for sparse optimal scoring problem. Neurocomputing 186, 170\u2013181 (2016)","journal-title":"Neurocomputing"},{"key":"1272_CR119","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Nguyen, T.B.T., Le,: H.M.: Sparse signal recovery by difference of convex functions algorithms. In: Intelligent Information and Database Systems. LNCS, vol. 7803, pp. 387\u2013397. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36543-0_40"},{"issue":"2","key":"1272_CR120","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10489-016-0758-2","volume":"45","author":"L Yang","year":"2016","unstructured":"Yang, L., Qian, Y.: A sparse logistic regression framework by difference of convex functions programming. Appl. Intell. 45(2), 241\u2013254 (2016)","journal-title":"Appl. Intell."},{"issue":"5","key":"1272_CR121","first-page":"2505","volume":"41","author":"L Wang","year":"2013","unstructured":"Wang, L., Kim, Y., Li, R.: Calibrating nonconvex penalized regression in ultra-high dimension. Ann. Stat. 41(5), 2505\u20132536 (2013)","journal-title":"Ann. Stat."},{"key":"1272_CR122","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.cnsns.2015.11.013","volume":"36","author":"Y Song","year":"2016","unstructured":"Song, Y., Lin, L., Jian, L.: Robust check loss-based variable selection of high-dimensional single-index varying-coefficient model. Commun. Nonlinear Sci. 36, 109\u2013128 (2016)","journal-title":"Commun. Nonlinear Sci."},{"key":"1272_CR123","first-page":"801","volume":"19","author":"Y Wu","year":"2009","unstructured":"Wu, Y., Liu, Y.: Variable selection in quantile regression. Stat. Sin. 19, 801\u2013817 (2009)","journal-title":"Stat. Sin."},{"issue":"12","key":"1272_CR124","doi-asserted-by":"crossref","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 Trans. Signal Process. 57(12), 4686\u20134698 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"1272_CR125","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-319-17996-4_4","volume-title":"Advanced Computational Methods for Knowledge Engineering","author":"TBT Nguyen","year":"2015","unstructured":"Nguyen, T.B.T., Le Thi, H.A., Le, H.M., Vo, X.T.: DC approximation approach for $$\\ell _0$$-minimization in compressed sensing. In: Le Thi, H.A., Nguyen, N.T., Do, T.V. (eds.) Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, vol. 358, pp. 37\u201348. Springer, Cham (2015)"},{"issue":"4","key":"1272_CR126","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1137\/13090540X","volume":"6","author":"E Esser","year":"2013","unstructured":"Esser, E., Lou, Y., Xin, J.: A method for finding structured sparse solutions to nonnegative least squares problems with applications. SIAM J. Imag. Sci. 6(4), 2010\u20132046 (2013)","journal-title":"SIAM J. Imag. Sci."},{"key":"1272_CR127","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-319-18161-5_15","volume-title":"Modelling, Computation and Optimization in Information Systems and Management Sciences","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Osher, S., Xin, J.: Computational aspects of constrained l1\u2013l2 minimization for compressive sensing. In: Le Thi, H.A., Pham Dinh, T., Nguyen, N.T. (eds.) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol. 359, pp. 169\u2013180. Springer, Cham (2015)"},{"issue":"1","key":"1272_CR128","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10915-014-9930-1","volume":"64","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Yin, P., He, Q., Xin, J.: Computing sparse representation in a highly coherent dictionary based on difference of L1 and L2. J. Sci. Comput. 64(1), 178\u2013196 (2015)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"1272_CR129","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1137\/140952363","volume":"37","author":"P Yin","year":"2015","unstructured":"Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of $$\\ell _{1-2}$$ for compressed sensing. SIAM J. Sci. Comput. 37(1), 536\u2013563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"1272_CR130","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/78.558475","volume":"45","author":"IF Gorodnitsky","year":"1997","unstructured":"Gorodnitsky, I.F., Rao, B.D.: Sparse signal reconstructions from limited data using FOCUSS: a re-weighted minimum norm algorithm. IEEE Trans. Signal Process. 45(3), 600\u2013616 (1997)","journal-title":"IEEE Trans. Signal Process."},{"key":"1272_CR131","doi-asserted-by":"crossref","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. Am. Stat. Assoc. 96, 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"issue":"476","key":"1272_CR132","doi-asserted-by":"crossref","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. Am. Stat. Assoc. 101(476), 1418\u20131429 (2006)","journal-title":"J. Am. Stat. Assoc."},{"key":"1272_CR133","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Candes","year":"2008","unstructured":"Candes, E.J., Wakin, M., Boyd, S.: Enhancing sparsity by reweighted-$$l_{1}$$ minimization. J. Fourier Anal. Appl. 14, 877\u2013905 (2008)","journal-title":"J. Fourier Anal. Appl."},{"key":"1272_CR134","doi-asserted-by":"crossref","unstructured":"Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 3869\u20133872 (2008)","DOI":"10.1109\/ICASSP.2008.4518498"},{"issue":"4","key":"1272_CR135","first-page":"1509","volume":"36","author":"H Zou","year":"2008","unstructured":"Zou, H., Li, R.: One-step sparse estimates in nonconcave penalized likelihood models. Ann. Stat. 36(4), 1509\u20131533 (2008)","journal-title":"Ann. Stat."},{"key":"1272_CR136","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1198\/106186006X113430","volume":"15","author":"H Zou","year":"2006","unstructured":"Zou, H., Hastie, T., Tibshirani, R.J.: Sparse principal component analysis. J. Comput. Graph. Stat. 15, 265\u2013286 (2006)","journal-title":"J. Comput. Graph. Stat."},{"key":"1272_CR137","doi-asserted-by":"crossref","first-page":"2477","DOI":"10.1109\/TSP.2005.849172","volume":"53","author":"SF Cotter","year":"2005","unstructured":"Cotter, S.F., Rao, B.D., Engan, K., Kreutz-Delgado, K.: Sparse solutions to linear inverse problems with multiple measurement vectors. IEEE Trans. Signal Process. 53, 2477\u20132488 (2005)","journal-title":"IEEE Trans. Signal Process."},{"key":"1272_CR138","doi-asserted-by":"crossref","first-page":"4634","DOI":"10.1109\/TSP.2006.881263","volume":"54","author":"J Chen","year":"2006","unstructured":"Chen, J., Huo, X.: Theoretical results on sparse representations of multiple-measurement vectors. IEEE Trans. Signal Process. 54, 4634\u20134643 (2006)","journal-title":"IEEE Trans. Signal Process."},{"key":"1272_CR139","first-page":"1812","volume-title":"Advances in Neural Information Processing Systems 22","author":"L Sun","year":"2009","unstructured":"Sun, L., Liu, J., Chen, J., Ye, J.: Efficient recovery of jointly sparse vectors. In: Bengio, Y., Schuurmans, D., Lafferty, J.D., Williams, C.K.I., Culotta, A. (eds.) Advances in Neural Information Processing Systems 22, pp. 1812\u20131820. Curran Associates Inc, Vancouver (2009)"},{"key":"1272_CR140","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.neunet.2020.08.024","volume":"132","author":"HA Le Thi","year":"2020","unstructured":"Le Thi, H.A., Le, H.M., Phan, D.N., Tran, B.: Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression. Neural Netw. 132, 220\u2013231 (2020)","journal-title":"Neural Netw."},{"key":"1272_CR141","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1111\/rssb.12033","volume":"76","author":"P Danaher","year":"2014","unstructured":"Danaher, P., Wang, P., Witten, D.M.: The joint graphical lasso for inverse covariance estimation across multiple classes. J. R. Stat. Soc. Series B Stat. Methodol. 76, 373\u2013397 (2014)","journal-title":"J. R. Stat. Soc. Series B Stat. Methodol."},{"key":"1272_CR142","first-page":"819","volume-title":"Advances in Neural Information Processing Systems 27","author":"D Calandriello","year":"2014","unstructured":"Calandriello, D., Lazaric, A., Restelli, M.: Sparse multi-task reinforcement learning. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N.D., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems 27, pp. 819\u2013827. Curran Associates Inc, Montreal (2014)"},{"issue":"11","key":"1272_CR143","doi-asserted-by":"crossref","first-page":"3040","DOI":"10.1162\/neco_a_01012","volume":"29","author":"DN Phan","year":"2017","unstructured":"Phan, D.N., Le Thi, H.A., Pham Dinh, T.: Sparse covariance matrix estimation by DCA-based algorithms. Neural Comput. 29(11), 3040\u20133077 (2017)","journal-title":"Neural Comput."},{"key":"1272_CR144","doi-asserted-by":"crossref","unstructured":"Vo, X.T., Le\u00a0Thi, H.A., Pham\u00a0Dinh, T., Nguyen, T.B.T.: DC programming and DCA for dictionary learning. In: Computational Collective Intelligence vol. 9329, pp. 295\u2013304. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-24069-5_28"},{"key":"1272_CR145","volume-title":"Robust Optimization. Princeton Series in Applied Mathematics","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.S.: Robust Optimization. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2009)"},{"key":"1272_CR146","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.neunet.2014.06.011","volume":"59","author":"HA 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 Netw. 59, 36\u201350 (2014)","journal-title":"Neural Netw."},{"key":"1272_CR147","unstructured":"Vo, X.T.: Learning with sparsity and uncertainty by difference of convex functions optimization. Ph.D. thesis, University of Lorraine (2015)"},{"key":"1272_CR148","first-page":"671","volume-title":"Intelligent Information and Database Systems","author":"XT Vo","year":"2016","unstructured":"Vo, X.T., Le Thi, H.A., Pham Dinh, T.: Robust optimization for clustering. In: Nguyen, N.T., Trawi\u0144ski, B., Fujita, H., Hong, T.-P. (eds.) Intelligent Information and Database Systems, pp. 671\u2013680. Springer, Berlin (2016)"},{"key":"1272_CR149","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S.: Online learning and online convex optimization. Found. Trends\u00ae Mach. Learn. 4(2), 107\u2013194 (2012)","DOI":"10.1561\/2200000018"},{"key":"1272_CR150","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the 20th on International Conference on Machine Learning, pp. 928\u2013935. AAAI Press, Washington (2003)"},{"issue":"2\u20133","key":"1272_CR151","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10994-007-5014-x","volume":"69","author":"S Shalev-Shwartz","year":"2007","unstructured":"Shalev-Shwartz, S., Singer, Y.: A primal-dual perspective of online learning algorithms. Mach. Learn. 69(2\u20133), 115\u2013142 (2007)","journal-title":"Mach. Learn."},{"key":"1272_CR152","doi-asserted-by":"crossref","unstructured":"Chung, T.H.: Approximate methods for sequential decision making using expert advice. In: Proceedings of the Seventh Annual Conference on Computational Learning Theory. COLT \u201994, pp. 183\u2013189. ACM, New York (1994)","DOI":"10.1145\/180139.181097"},{"issue":"15","key":"1272_CR153","doi-asserted-by":"crossref","first-page":"9521","DOI":"10.1007\/s00521-021-05709-0","volume":"33","author":"HA Le Thi","year":"2021","unstructured":"Le Thi, H.A., Ho, V.T.: DCA for online prediction with expert advice. Neural Comput. Appl. 33(15), 9521\u20139544 (2021)","journal-title":"Neural Comput. Appl."},{"issue":"2","key":"1272_CR154","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10898-018-0698-y","volume":"73","author":"HA Le Thi","year":"2019","unstructured":"Le Thi, H.A., Ho, V.T., Pham Dinh, T.: A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning. J. Global Optim. 73(2), 279\u2013310 (2019)","journal-title":"J. Global Optim."},{"issue":"12","key":"1272_CR155","doi-asserted-by":"crossref","first-page":"5603","DOI":"10.1109\/TNNLS.2020.2975051","volume":"31","author":"GC Calafiore","year":"2020","unstructured":"Calafiore, G.C., Gaubert, S., Possieri, C.: A universal approximation result for difference of log-sum-exp neural networks. IEEE Trans. Neural Netw. Learn. Syst. 31(12), 5603\u20135612 (2020)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"4","key":"1272_CR156","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1109\/LCSYS.2020.3032083","volume":"5","author":"S Br\u00fcggemann","year":"2020","unstructured":"Br\u00fcggemann, S., Possieri, C.: On the use of difference of log-sum-exp neural networks to solve data-driven model predictive control tracking problems. IEEE Control Syst. Lett. 5(4), 1267\u20131272 (2020)","journal-title":"IEEE Control Syst. Lett."},{"key":"1272_CR157","unstructured":"Sankaranarayanan, P., Rengaswamy, R.: CDiNN-Convex Difference Neural Networks. Preprint at https:\/\/arxiv.org\/abs\/2103.17231 (2021)"},{"issue":"2","key":"1272_CR158","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1137\/18M1231559","volume":"30","author":"Y Cui","year":"2020","unstructured":"Cui, Y., He, Z., Pang, J.-S.: Multicomposite nonconvex optimization for training deep neural networks. SIAM J. Optim. 30(2), 1693\u20131723 (2020)","journal-title":"SIAM J. Optim."},{"key":"1272_CR159","unstructured":"Berrada, L., Zisserman, A., Kumar, M.P.: Trusting SVM for piecewise linear CNNs. Preprint at https:\/\/arxiv.org\/abs\/1611.02185 (2016)"},{"issue":"1","key":"1272_CR160","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0022-247X(67)90163-1","volume":"17","author":"OL Mangasarian","year":"1967","unstructured":"Mangasarian, O.L., Fromovitz, S.: The fritz john necessary optimality conditions in the presence of equality and inequality constraints. J. Math. Anal. Appl. 17(1), 37\u201347 (1967)","journal-title":"J. Math. Anal. Appl."},{"key":"1272_CR161","volume-title":"Nonlinear Programming","author":"OL Mangasarian","year":"1969","unstructured":"Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill, New York (1969)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01272-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01272-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01272-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T12:51:22Z","timestamp":1728910282000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01272-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,15]]},"references-count":161,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1272"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01272-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,15]]},"assertion":[{"value":"17 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}