{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:38:38Z","timestamp":1775068718402,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":52,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642544545","type":"print"},{"value":"9783642544552","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54455-2_1","type":"book-chapter","created":{"date-parts":[[2014,2,7]],"date-time":"2014-02-07T03:33:45Z","timestamp":1391744025000},"page":"1-37","source":"Crossref","is-referenced-by-count":98,"title":["Recent Advances in DC Programming and DCA"],"prefix":"10.1007","author":[{"given":"Tao","family":"Pham Dinh","sequence":"first","affiliation":[]},{"given":"Hoai An","family":"Le Thi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/040605266","volume":"16","author":"P.A. Absil","year":"2005","unstructured":"Absil, P.A., Mahony, R., Andrews, B.: Convergence of the iterates of descent methods for analytic cost functions. SIAM J. Optim.\u00a016, 531\u2013547 (2005)","journal-title":"SIAM J. Optim."},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-007-0133-5","volume":"116","author":"H. Attouch","year":"2009","unstructured":"Attouch, H., Bolte, J.: The convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program.\u00a0116, 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J. Bolte","year":"2007","unstructured":"Bolte, J., Daniliidis, A., Lewis, A.: Lojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamic systems. SIAM Optim.\u00a017(4), 1205\u20131223 (2007)","journal-title":"SIAM Optim."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"3319","DOI":"10.1090\/S0002-9947-09-05048-X","volume":"362","author":"J. Bolte","year":"2010","unstructured":"Bolte, J., Daniliidis, A., Ley, O., Mazet, L.: Characterizations of Lojasiewicz inequalities: Subgradient flows, talweg, convexity. Trans. Amer. Math. Soc.\u00a0362, 3319\u20133363 (2010)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF02699126","volume":"67","author":"E. Bierstone","year":"1988","unstructured":"Bierstone, E., Milman, P.: Semianalytic and subanalytic sets. IHES Publ. Math.\u00a067, 5\u201342 (1988)","journal-title":"IHES Publ. Math."},{"key":"1_CR6","unstructured":"Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Proceedings of the Fifteenth International Conference on Machine Learning (ICML 1998), pp. 82\u201390 (1998)"},{"key":"1_CR7","doi-asserted-by":"publisher","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. IEEE Trans. Image Process.\u00a07, 319\u2013335 (1998)","journal-title":"IEEE Trans. Image Process."},{"key":"1_CR8","volume-title":"Optimization and Nonsmooth Analysis","author":"F.H. Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P. Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. B\u00a039, 1\u201338 (1977)","journal-title":"J. Roy. Stat. Soc. B"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0096-3003(89)90005-2","volume":"34","author":"R.P. Ge","year":"1989","unstructured":"Ge, R.P., Huang, C.B.: A Continuous Approach to Nonlinear Integer Programming. Applied Mathematics and Computation\u00a034, 39\u201360 (1989)","journal-title":"Applied Mathematics and Computation"},{"key":"1_CR11","unstructured":"Hoang, T.: Convex Analysis and Global Optimization. Kluwer Academic (2000)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Horst, R., Hoang, T.: Global Optimization: Deterministic Approaches, 3rd edn. Springer (1996)","DOI":"10.1007\/978-3-662-03199-5"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1021765131316","volume":"103","author":"R. Horst","year":"1999","unstructured":"Horst, R., Nguyen, V.T.: DC Programming: Overview. Journal of Optimization Theory and Applications\u00a0103(1), 1\u201343 (1999)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"1_CR14","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms, Parts I&II. Springer (1991)"},{"key":"1_CR15","unstructured":"DC Programming and DCA, http:\/\/lita.sciences.univ-metz.fr\/~lethi\/DCA.html"},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s101070050003","volume":"87","author":"H.A. Thi Le","year":"2000","unstructured":"Le Thi, H.A.: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints. Mathematical Programming, Ser. A\u00a087(3), 401\u2013426 (2000)","journal-title":"Mathematical Programming, Ser. A"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"H.A. Thi Le","year":"1997","unstructured":"Le Thi, H.A., Pham Dinh, T.: Solving a class of linearly constrained indefinite quadratic problems by DC Algorithms. Journal of Global Optimization\u00a011, 253\u2013285 (1997)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"1_CR18","first-page":"169","volume":"27","author":"H.A. Thi Le","year":"1999","unstructured":"Le Thi, H.A., Pham Dinh, T., Le, D.M.: Exact penalty in DC programming. Vietnam Journal of Mathematics\u00a027(2), 169\u2013178 (1999)","journal-title":"Vietnam Journal of Mathematics"},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/S1052623498342794","volume":"14","author":"H.A. Thi Le","year":"2003","unstructured":"Le Thi, H.A., Pham Dinh, T.: Large scale global molecular optimization from distance matrices by a DC optimization appoach. SIAM J. Optim.\u00a014(1), 77\u2013116 (2003)","journal-title":"SIAM J. Optim."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"H.A. Thi Le","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\u201348 (2005)","journal-title":"Annals of Operations Research"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1016\/j.ejor.2005.06.079","volume":"183","author":"L.T.H. An","year":"2007","unstructured":"An, L.T.H., Phuc, N.T., Tao, P.D.: A continuous approach for solving the concave cost supply problem by combining DCA and B&B techniques. European Journal of Operational Research\u00a0183, 1001\u20131012 (2007)","journal-title":"European Journal of Operational Research"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.dam.2007.03.024","volume":"156","author":"L.T.H. An","year":"2008","unstructured":"An, L.T.H., Tao, P.D.: A continuous approach for the concave cost supply problem via DC Programming and DCA. Discrete Applied Mathematics\u00a0156, 325\u2013338 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR23","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC Programming and DCA for solving general DC programs. Research Report, National Institute for Applied Sciences, Rouen (2008)"},{"key":"1_CR24","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: DC Programming and DCA for solving DC programs with DC constraints (submitted)"},{"key":"1_CR25","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: Convergence Analysis of DC Algorithms for DC programming with subanalytic data. Research Report, National Institute for Applied Sciences, Rouen (2009) (forthcoming)"},{"key":"1_CR26","series-title":"Research Report","volume-title":"Approximation and Penalization of the \u21130-norm in DC Programming","author":"H.A. Thi Le","year":"2010","unstructured":"Le Thi, H.A., Pham Dinh, T.: Approximation and Penalization of the \u21130-norm in DC Programming. Research Report. National Institute for Applied Sciences, Rouen (2010)"},{"key":"1_CR27","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC Programming and DCA for solving nonconvex programs involving \u21130-norm. Research Report, National Institute for Applied Sciences, Rouen (2011) (forthcoming)"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Thi, H.A.L., Moeini, M.: Long-Short Portfolio Optimization Under Cardinality Constraints by Difference of Convex Functions Algorithm. Journal of Optimization Theory & Applications, 27 pages (October 2012), doi:10.1007\/s10957-012-0197-0","DOI":"10.1007\/s10957-012-0197-0"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Pham Dinh, T.: Exact Penalty in Mixed Integer DC Programming. Research Report, Lorraine University, France (2011)","DOI":"10.1007\/s10898-011-9765-3"},{"issue":"3","key":"1_CR30","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10898-011-9765-3","volume":"52","author":"H.A. Thi Le","year":"2012","unstructured":"Le Thi, H.A., Pham Dinh, T., Huynh, V.N.: Exact penalty and Error Bounds in DC programming. Journal of Global Optimization\u00a052(3), 509\u2013535 (2012) Special Issue in Memory of Reiner Horst, Founder of the Journal","journal-title":"Journal of Global Optimization"},{"key":"1_CR31","unstructured":"Le Thi, H.A., Pham, V.N., Pham Dinh, T., Yi-Shuai, N.: DC Programming Approaches for Discrete Portfolio Optimization under Concave Transaction Costs (submitted)"},{"key":"1_CR32","unstructured":"Le Thi, H.A., Pham Dinh, T., Thiao, M.: Learning with sparsity by a new and efficient convex approach for \u21132-\u21130 regularization (submitted)"},{"key":"1_CR33","volume-title":"Nonlinear integer programming","author":"D. Li","year":"2006","unstructured":"Li, D., Sun, X.L.: Nonlinear integer programming. Springer, New York (2006)"},{"key":"1_CR34","doi-asserted-by":"crossref","first-page":"87","DOI":"10.4064\/sm-18-1-87-136","volume":"18","author":"S. Lojasiewicz","year":"1959","unstructured":"Lojasiewicz, S.: Sur le probl\u00e8me de la division. Studia Mathematica\u00a018, 87\u2013136 (1959)","journal-title":"Studia Mathematica"},{"key":"1_CR35","first-page":"87","volume-title":"Les Equations aux d\u00e9riv\u00e9es Partielles","author":"S. Lojasiewicz","year":"1963","unstructured":"Lojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. In: Les Equations aux d\u00e9riv\u00e9es Partielles, pp. 87\u201389. Editions du Centre National de la Recherche Scientifique, Paris (1963)"},{"key":"1_CR36","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.5802\/aif.1384","volume":"43","author":"S. Lojasiewicz","year":"1993","unstructured":"Lojasiewicz, S.: Sur la g\u00e9om\u00e9trie semi-et sous-analytique. Annales de l\u2019Institut Fourier\u00a043, 1575\u20131595 (1993)","journal-title":"Annales de l\u2019Institut Fourier"},{"issue":"3","key":"1_CR37","first-page":"375","volume":"27","author":"P. Mahey","year":"1993","unstructured":"Mahey, P., Tao, P.D.: Partial regularization of the sum of two maximal monotone operators. M2AN (Mod\u00e9lisation Math\u00e9 Matique et Analyse Num\u00e9rique) Communicated by P.L. Lions\u00a027(3), 375\u2013398 (1993)","journal-title":"M2AN (Mod\u00e9lisation Math\u00e9 Matique et Analyse Num\u00e9rique) Communicated by P.L. Lions"},{"key":"1_CR38","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1137\/0805023","volume":"5","author":"P. Mahey","year":"1995","unstructured":"Mahey, P., Pham Dinh, T.: Proximal decomposition on the graph of a maximal monotone operator. SIAM Journal on Optimization\u00a05, 454\u2013469 (1995)","journal-title":"SIAM Journal on Optimization"},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/0022-247X(67)90163-1","volume":"17","author":"O.L. Mangasarian","year":"1967","unstructured":"Mangasarian, O.L., Fromovitz, S.: The Fritz John necessay optimality conditions in the presence of equality constraints. J. Math. Anal. Appl.\u00a017, 34\u201347 (1967)","journal-title":"J. Math. Anal. Appl."},{"key":"1_CR40","volume-title":"Nonlinear Programming","author":"O.L. Mangasarian","year":"1969","unstructured":"Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill, New York (1969)"},{"key":"1_CR41","unstructured":"Niu, Y.S.: Programmation DC & DCA en Optimisation Combinatoire et Optimisation Polynomiale via les Techniques de SDP. PhD thesis, INSA de Rouen, France (2010)"},{"issue":"1","key":"1_CR42","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 Mathematica Vietnamica\u00a022(1), 289\u2013355 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"issue":"2","key":"1_CR43","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T. Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: A DC Optimization algorithm for solving the trust region subproblem. SIAM J. Optim.\u00a08(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"1_CR44","unstructured":"Pham Dinh, T., Le Thi, H.A.: DC Programming: Theory, Algorithms and Applications. The State of the Art (28 pages). In: Proceedings of the First International Workshop on Global Constrained Optimization and Constraint Satisfaction (Cocos 2002), Valbonne-Sophia Antipolis, France, October 2-4 (2002)"},{"issue":"4","key":"1_CR45","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10898-009-9507-y","volume":"48","author":"T. Pham Dinh","year":"2010","unstructured":"Pham Dinh, T., Nguyen, C.N., Le Thi, H.A.: An efficient combination of DCA and B&B using DC\/SDP relaxation for globally solving binary quadratic programs. Journal of Global Optimization\u00a048(4), 595\u2013632 (2010)","journal-title":"Journal of Global Optimization"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press (1970)","DOI":"10.1515\/9781400873173"},{"key":"1_CR47","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01448388","volume":"10","author":"J. Spingarn","year":"1983","unstructured":"Spingarn, J.: Partial inverse of a monotone operator. Applied Mathematics and Optimization\u00a010, 247\u2013265 (1983)","journal-title":"Applied Mathematics and Optimization"},{"key":"1_CR48","series-title":"Progress in Math.","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-2008-4","volume-title":"Geometry of subanalytic and semialgebraic sets","author":"M. Shiota","year":"1997","unstructured":"Shiota, M.: Geometry of subanalytic and semialgebraic sets. Progress in Math., vol.\u00a0150. Birkhauser Boston, Inc., Boston (1997)"},{"key":"1_CR49","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/moor.1030.0069","volume":"29","author":"M.V. Solodov","year":"2004","unstructured":"Solodov, M.V.: On the sequential quadratically constrained quadratic programming methods. Mathematics of Oper. Research\u00a029, 64\u201379 (2004)","journal-title":"Mathematics of Oper. Research"},{"key":"1_CR50","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-87477-5_39","volume-title":"Modelling, Computation and Optimization in Information Systems and Management Sciences","author":"M. Thiao","year":"2008","unstructured":"Thiao, M., Pham Dinh, T., Le Thi, H.: DC programming approach for a class of nonconvex programs involving zero-norm. In: MCO 2008. CCIS, vol.\u00a014, pp. 358\u2013367. Springer, Heidelberg (2008)"},{"key":"1_CR51","unstructured":"Thiao, M., Pham Dinh, T., Le Thi, H.A.: A DC programming approach for Sparse Eigenvalue Problem. In: Proceeding of ICML 2010, pp. 1063\u20131070 (2010)"},{"issue":"4","key":"1_CR52","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"A.L. Yuille","year":"2003","unstructured":"Yuille, A.L., Rangarajan, A.: The concave-convex procedure. Neural Computation\u00a015(4), 915\u2013936 (2003)","journal-title":"Neural Computation"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Intelligence XIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54455-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T02:11:06Z","timestamp":1716516666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54455-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544545","9783642544552"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54455-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}