{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T00:06:33Z","timestamp":1775693193462,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T00:00:00Z","timestamp":1532563200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10957-018-1345-y","type":"journal-article","created":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T12:06:36Z","timestamp":1532606796000},"page":"103-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Convergence Analysis of Difference-of-Convex Algorithm with Subanalytic Data"],"prefix":"10.1007","volume":"179","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2239-2100","authenticated-orcid":false,"given":"Hoai An","family":"Le Thi","sequence":"first","affiliation":[]},{"given":"Van Ngai","family":"Huynh","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Pham Dinh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,26]]},"reference":[{"issue":"1","key":"1345_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1137\/S1052623498342794","volume":"14","author":"HA Thi Le","year":"2003","unstructured":"Le Thi, H.A., Pham Dinh, T.: Large scale global molecular optimization from distance matrices by a DC optimization approach. SIAM J. Optim. 14(1), 77\u2013116 (2003)","journal-title":"SIAM J. Optim."},{"key":"1345_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"HA 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. Ann. Oper. Res. 133, 23\u201348 (2005)","journal-title":"Ann. Oper. Res."},{"key":"1345_CR3","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. Vietnam. 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"issue":"2","key":"1345_CR4","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. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"1345_CR5","unstructured":"Le Thi, H.A.: DC programming and DCA. \n                    http:\/\/www.lita.univ-lorraine.fr\/~lethi\/index.php\/dca.html\n                    \n                   (homepage) (2005)"},{"key":"1345_CR6","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC programming and DCA: theory, algorithms and applications. Special Issue of Math. Program. Series B, Dedicated to Thirty Years of Developments, 169(1) (2018)","DOI":"10.1007\/s10107-018-1235-y"},{"issue":"4","key":"1345_CR7","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamic systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"1345_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.4064\/sm-18-1-87-136","volume":"18","author":"S \u0141ojasiewicz","year":"1959","unstructured":"\u0141ojasiewicz, S.: Sur le probl\u00e8me de la division. Studia Math. 18, 87\u2013136 (1959)","journal-title":"Studia Math."},{"key":"1345_CR9","unstructured":"\u0141ojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques. In: Les Equations aux D\u00e9riv\u00e9es Partielles, Editions du Centre National de la Recherche Scientifique, Paris, pp. 87\u201389 (1963)"},{"issue":"5","key":"1345_CR10","doi-asserted-by":"publisher","first-page":"1575","DOI":"10.5802\/aif.1384","volume":"43","author":"S \u0141ojasiewicz","year":"1993","unstructured":"\u0141ojasiewicz, S.: Sur la g\u00e9om\u00e9trie semi- et sous-analytique. Ann. Inst. Fourier (Grenoble) 43(5), 1575\u20131595 (1993)","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"key":"1345_CR11","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. 67, 5\u201342 (1988)","journal-title":"IHES Publ. Math."},{"key":"1345_CR12","series-title":"Progress in Mathematics","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 Mathematics, vol. 150. Birkhauser Boston, Inc., Boston, MA (1997)"},{"key":"1345_CR13","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. 16, 531\u2013547 (2005)","journal-title":"SIAM J. Optim."},{"key":"1345_CR14","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. 116, 5\u201316 (2009)","journal-title":"Math. Program."},{"key":"1345_CR15","doi-asserted-by":"publisher","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, 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"1345_CR16","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1137\/0805023","volume":"5","author":"P Mahey","year":"1995","unstructured":"Mahey, P., Oualibouch, S., Pham Dinh, T.: Proximal decomposition on the graph of monotone operator. SIAM J. Optim. 5(2), 454\u2013466 (1995)","journal-title":"SIAM J. Optim."},{"key":"1345_CR17","series-title":"Grundlehren Math. Wiss","volume-title":"Variational analysis and generalized differentiation. I. Basic theory","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational analysis and generalized differentiation. I. Basic theory. Grundlehren Math. Wiss, vol. 330. Springer, Berlin (2006)"},{"key":"1345_CR18","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1345_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, J.-B.: Variational Analysis. Springer, New York (1998)"},{"key":"1345_CR20","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"HA Thi Le","year":"1997","unstructured":"Le Thi, H.A., Pham Dinh, T.: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J. Global Optim. 11, 253\u2013285 (1997)","journal-title":"J. Global Optim."},{"issue":"4","key":"1345_CR21","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1080\/10556780802263990","volume":"23","author":"T Pham Dinh","year":"2008","unstructured":"Pham Dinh, T., Le Thi, H.A., Akoa, F.: Combining DCA and interior point techniques for large-scale nonconvex quadratic programming. Optim. Method Softw. 23(4), 609\u2013629 (2008)","journal-title":"Optim. Method Softw."},{"key":"1345_CR22","volume-title":"Convex Analysis and Minimization Algorithms II., Advanced Theory and Bundle Methods","author":"J-B Hiriart-Urruty","year":"1996","unstructured":"Hiriart-Urruty, J.-B., Lemarchal, C.: Convex Analysis and Minimization Algorithms II., Advanced Theory and Bundle Methods, 2nd edn. Springer, Berlin (1996)","edition":"2"},{"issue":"5","key":"1345_CR23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0167-6377(96)00036-3","volume":"19","author":"T Pham Dinh","year":"1996","unstructured":"Pham Dinh, T., Le Thi, H.A.: Difference of convex function optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres. Oper. Res. Lett. 19(5), 207\u2013216 (1996)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1345_CR24","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1009777410170","volume":"2","author":"HA Thi Le","year":"1998","unstructured":"Le Thi, H.A., Pham Dinh, T., Muu, L.D.: A combined D.C. optimization-ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems. J. Comb. Optim. 2(1), 9\u201328 (1998)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"1345_CR25","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1008240227198","volume":"13","author":"HA Thi Le","year":"1998","unstructured":"Le Thi, H.A., Pham Dinh, T.: A branch-and-bound method via D.C. optimization algorithm and ellipsoidal technique for box constrained nonconvex quadratic programming problems. J. Global Optim. 13(2), 171\u2013206 (1998)","journal-title":"J. Global Optim."},{"issue":"3","key":"1345_CR26","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s101070050003","volume":"87","author":"HA Thi Le","year":"2000","unstructured":"Le Thi, H.A.: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints. Math. Program. 87(3), 401\u2013426 (2000)","journal-title":"Math. Program."},{"key":"1345_CR27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods. MPS\/SIAM Ser. Optim","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, PhL: Trust-Region Methods. MPS\/SIAM Ser. Optim. SIAM, Philedalphia (2000)"},{"issue":"3","key":"1345_CR28","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1007\/s10957-012-0041-6","volume":"154","author":"HN Tuan","year":"2012","unstructured":"Tuan, H.N.: Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem. J. Optim. Theory Appl. 154(3), 904\u2013915 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"1345_CR29","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10898-011-9696-z","volume":"53","author":"HA Thi Le","year":"2012","unstructured":"Le Thi, H.A., Pham Dinh, T., Yen, N.D.: Behavior of DCA sequences for solving the trust-region subproblem. J. Global Optim. 53, 317\u2013329 (2012)","journal-title":"J. Global Optim."},{"issue":"2","key":"1345_CR30","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10898-011-9820-0","volume":"55","author":"HN Tuan","year":"2013","unstructured":"Tuan, H.N., Yen, N.D.: Convergence of Pham Dinh-Le Thi\u2019s algorithm for the trust-region subproblem. J. Global Optim. 55(2), 337\u2013347 (2013)","journal-title":"J. Global Optim."},{"key":"1345_CR31","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10107-007-0121-9","volume":"116","author":"VN Huynh","year":"2009","unstructured":"Huynh, V.N., Th\u00e9ra, M.: Error bounds for systems of lower semicontinuous functions in Asplund spaces. Math. Program. 116, 397\u2013427 (2009)","journal-title":"Math. Program."},{"key":"1345_CR32","volume-title":"Nonlinear Optimization: Complexity Issues","author":"SA Vavasis","year":"1991","unstructured":"Vavasis, S.A.: Nonlinear Optimization: Complexity Issues. Oxford University Press, Oxford (1991)"},{"issue":"1\u20134","key":"1345_CR33","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1080\/10556789908805759","volume":"11","author":"RJ Vanderbei","year":"1999","unstructured":"Vanderbei, R.J.: LOQO: an interior point code for quadratic programming. Optim. Method Softw. 11(1\u20134), 451\u2013484 (1999)","journal-title":"Optim. Method Softw."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-018-1345-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1345-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-018-1345-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T19:14:11Z","timestamp":1564082051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-018-1345-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,26]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["1345"],"URL":"https:\/\/doi.org\/10.1007\/s10957-018-1345-y","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7,26]]},"assertion":[{"value":"11 April 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}