{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T18:44:04Z","timestamp":1778697844586,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T00:00:00Z","timestamp":1715385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T00:00:00Z","timestamp":1715385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["304666\/2021-1"],"award-info":[{"award-number":["304666\/2021-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["313901\/2020-1"],"award-info":[{"award-number":["313901\/2020-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10589-024-00578-4","type":"journal-article","created":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T16:01:36Z","timestamp":1715443296000},"page":"783-818","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A boosted DC algorithm for non-differentiable DC components with non-monotone line search"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5758-0320","authenticated-orcid":false,"given":"O. P.","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"E. M.","family":"Santos","sequence":"additional","affiliation":[]},{"given":"J. C. O.","family":"Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,11]]},"reference":[{"key":"578_CR1","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10589-020-00173-3","volume":"76","author":"YT Almeida","year":"2020","unstructured":"Almeida, Y.T., Cruz Neto, J.X., Oliveira, P.R., Souza, J.C.O.: A modified proximal point method for DC functions on Hadamard manifolds. Comput. Optim. Appl. 76, 649\u2013673 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"578_CR2","doi-asserted-by":"crossref","unstructured":"An, L.T.H., Tao, P.D.: D.C. programming approach to the multidimensional scaling problem. In: From Local to Global Optimization (Rimforsa, 1997), vol.\u00a053 of Nonconvex Optim. Appl., Kluwer Acad. Publ., Dordrecht, pp.\u00a0231\u2013276 (2001)","DOI":"10.1007\/978-1-4757-5284-7_11"},{"key":"578_CR3","first-page":"77","volume":"23","author":"NT An","year":"2016","unstructured":"An, N.T., Nam, N.M., Yen, N.D.: A D.C. algorithm via convex analysis approach for solving a location problem involving sets. J. Convex Anal. 23, 77\u2013101 (2016)","journal-title":"J. Convex Anal."},{"key":"578_CR4","doi-asserted-by":"crossref","unstructured":"Arag\u00f3n Artacho, F.J., Fleming, R.M.T., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. Math. Program. 95\u2013118 (2018)","DOI":"10.1007\/s10107-017-1180-1"},{"key":"578_CR5","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1137\/18M123339X","volume":"30","author":"FJ Arag\u00f3n Artacho","year":"2020","unstructured":"Arag\u00f3n Artacho, F.J., Vuong, P.T.: The boosted difference of convex functions algorithm for nonsmooth functions. SIAM J. Optim. 30, 980\u20131006 (2020)","journal-title":"SIAM J. Optim."},{"key":"578_CR6","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka\u2013\u0141ojasiewicz inequality. Math. Oper. Res. 35, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"578_CR7","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\u2013Seidel methods. Math. Program. 137, 91\u2013129 (2013)","journal-title":"Math. Program."},{"key":"578_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-010-9569-x","volume":"50","author":"AM Bagirov","year":"2011","unstructured":"Bagirov, A.M., Ugon, J.: Codifferential method for minimizing nonsmooth DC functions. J. Global Optim. 50, 3\u201322 (2011)","journal-title":"J. Global Optim."},{"key":"578_CR9","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1080\/10556788.2017.1371717","volume":"33","author":"AM Bagirov","year":"2018","unstructured":"Bagirov, A.M., Ugon, J.: Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms. Optim. Methods Softw. 33, 194\u2013219 (2018)","journal-title":"Optim. Methods Softw."},{"key":"578_CR10","doi-asserted-by":"crossref","unstructured":"Beck, A.: First-Order Methods in Optmization, 1st edn. Society for Industrial and Applied Mathematics-SIAM and Mathematical Optimization Society (2017)","DOI":"10.1137\/1.9781611974997"},{"key":"578_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/18M1217760","volume":"30","author":"A Beck","year":"2020","unstructured":"Beck, A., Hallak, N.: On the convergence to stationary points of deterministic and randomized feasible descent directions methods. SIAM J. Optim. 30, 56\u201379 (2020)","journal-title":"SIAM J. Optim."},{"key":"578_CR12","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TIP.2009.2028250","volume":"18","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. IEEE Trans. Image Process. 18, 2419\u20132434 (2009)","journal-title":"IEEE Trans. Image Process."},{"issue":"2","key":"578_CR13","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/B:COAP.0000026886.61324.e4","volume":"28","author":"I Bomze","year":"2004","unstructured":"Bomze, I., Locatelli, M.: Undominated DC decompositions of quadratic functions and applications to branch-and-bound approaches. Comput. Optim. Appl. 28(2), 227\u2013245 (2004)","journal-title":"Comput. Optim. Appl."},{"key":"578_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BF01592245","volume":"71","author":"J Brimberg","year":"1995","unstructured":"Brimberg, J.: The Fermat\u2013Weber location problem revisited. Math. Program. 71, 71\u201376 (1995)","journal-title":"Math. Program."},{"key":"578_CR15","doi-asserted-by":"crossref","unstructured":"Caselles, V., Chambolle, A., Cremers, D., Novaga, M., Pock, T.: An introduction to total variation for image analysis. Theoretical Foundations and Numerical Methods for Sparse Recovery. Comp. Appl. Math. 9, 263\u2013340 (2010)","DOI":"10.1515\/9783110226157.263"},{"key":"578_CR16","volume-title":"Optimization and Nonsmooth Analysis. Canadian Mathematical Society Series of Monographs and Advanced Texts","author":"F Clarke","year":"1983","unstructured":"Clarke, F.: Optimization and Nonsmooth Analysis. Canadian Mathematical Society Series of Monographs and Advanced Texts. Wiley (1983)"},{"key":"578_CR17","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1080\/02331934.2018.1476859","volume":"68","author":"JX Cruz Neto","year":"2019","unstructured":"Cruz Neto, J.X., Lopes, J.O., Santos, P.S.M., Souza, J.C.O.: An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels. Optimization 68, 1305\u20131319 (2019)","journal-title":"Optimization"},{"key":"578_CR18","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10479-018-3104-8","volume":"289","author":"JX CruzNeto","year":"2020","unstructured":"CruzNeto, J.X., Oliveira, P.R., Soubeyran, A., Souza, J.C.O.: A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem. Ann. Oper. Res. 289, 313\u2013339 (2020)","journal-title":"Ann. Oper. Res."},{"key":"578_CR19","doi-asserted-by":"publisher","first-page":"2131","DOI":"10.1080\/02331934.2020.1778685","volume":"69","author":"TH Cuong","year":"2020","unstructured":"Cuong, T.H., Yao, J.-C., Yen, N.D.: Qualitative properties of the minimum sum-of-squares clustering problem. Optimization 69, 2131\u20132154 (2020)","journal-title":"Optimization"},{"key":"578_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"578_CR21","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10898-008-9343-5","volume":"43","author":"A Ferrer","year":"2009","unstructured":"Ferrer, A., Martinez-Legaz, J.E.: Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function. J. Glob. Optim. 43, 513\u2013531 (2009)","journal-title":"J. Glob. Optim."},{"key":"578_CR22","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10898-019-00755-4","volume":"75","author":"W de Oliveira","year":"2019","unstructured":"de Oliveira, W.: Proximal bundle methods for nonsmooth DC programming. J. Glob. Optim. 75, 523\u2013563 (2019)","journal-title":"J. Glob. Optim."},{"key":"578_CR23","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s11228-020-00566-w","volume":"28","author":"W de Oliveira","year":"2020","unstructured":"de Oliveira, W.: The ABC of DC programming. Set-Valued Var. Anal. 28, 679\u2013706 (2020)","journal-title":"Set-Valued Var. Anal."},{"key":"578_CR24","doi-asserted-by":"publisher","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, 895\u2013919 (2019)","journal-title":"Set-Valued Var. Anal."},{"key":"578_CR25","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/s10898-018-0671-9","volume":"72","author":"W Geremew","year":"2018","unstructured":"Geremew, W., Nam, N.M., Semenov, A., Boginski, V., Pasiliao, E.: A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique. J. Glob. Optim. 72, 705\u2013729 (2018)","journal-title":"J. Glob. Optim."},{"key":"578_CR26","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-017-1181-0","volume":"169","author":"J-Y Gotoh","year":"2018","unstructured":"Gotoh, J.-Y., Takeda, A., Tono, K.: DC formulations and algorithms for sparse optimization problems. Math. Program. 169, 141\u2013176 (2018)","journal-title":"Math. Program."},{"key":"578_CR27","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10589-017-9928-3","volume":"68","author":"GN Grapiglia","year":"2017","unstructured":"Grapiglia, G.N., Sachs, E.W.: On the worst-case evaluation complexity of non-monotone line search algorithms. Comput. Optim. Appl. 68, 555\u2013577 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"578_CR28","doi-asserted-by":"crossref","unstructured":"Grapiglia, G.N., Sachs, E.W.: A generalized worst-case complexity analysis for non-monotone line searches. Numer. Algorithms (2020)","DOI":"10.1007\/s11075-020-00987-6"},{"key":"578_CR29","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"key":"578_CR30","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex analysis and minimization algorithms. I, vol.\u00a0305 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer, Berlin (1993). Fundamentals","DOI":"10.1007\/978-3-662-02796-7"},{"key":"578_CR31","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10898-016-0488-3","volume":"68","author":"K Joki","year":"2017","unstructured":"Joki, K., Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M.: A proximal bundle method for nonsmooth dc optimization utilizing nonconvex cutting planes. J. Glob. Optim. 68, 501\u2013535 (2017)","journal-title":"J. Glob. Optim."},{"key":"578_CR32","doi-asserted-by":"publisher","first-page":"1892","DOI":"10.1137\/16M1115733","volume":"28","author":"K Joki","year":"2018","unstructured":"Joki, K., Bagirov, A.M., Karmitsa, N., M\u00e4kel\u00e4, M.M., Taheri, S.: Double bundle method for finding Clarke stationary points in nonsmooth DC programming. SIAM J. Optim. 28, 1892\u20131919 (2018)","journal-title":"SIAM J. Optim."},{"key":"578_CR33","unstructured":"Khamaru, K., Wainwright, M.J.: Convergence guarantees for a class of non-convex and non-smooth optimization problems. J. Mach. Learn. Res. 20, Paper No. 154, 52 (2019)"},{"key":"578_CR34","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","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. 169, 5\u201368 (2018)","journal-title":"Math. Program."},{"key":"578_CR35","doi-asserted-by":"crossref","unstructured":"Locatelli, M., Schoen, F.: Global Optimization: Theory, Algorithms, and Applications, MOS-SIAM Ser. Optim. 15. SIAM, Philadelphia (2013)","DOI":"10.1137\/1.9781611972672"},{"key":"578_CR36","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1137\/14098435X","volume":"8","author":"Y Lou","year":"2015","unstructured":"Lou, Y., Zeng, T., Osher, S., Xin, J.: A weighted difference of anisotropic and isotropic total variation model for image processing. SIAM J. Imaging Sci. 8, 179\u20131823 (2015)","journal-title":"SIAM J. Imaging Sci."},{"key":"578_CR37","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau, J.J.: A proximit\u00e9 et dualit\u00e9 dans un espace Hilbertien. Bull. Soc. Math. Fr. 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. Fr."},{"key":"578_CR38","first-page":"475","volume":"24","author":"A Moudafi","year":"2006","unstructured":"Moudafi, A., Maing\u00e9, P.-E.: On the convergence of an approximate proximal method for DC functions. J. Comput. Math. 24, 475\u2013480 (2006)","journal-title":"J. Comput. Math."},{"key":"578_CR39","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s11590-017-1183-0","volume":"12","author":"NM Nam","year":"2018","unstructured":"Nam, N.M., Geremew, W., Reynolds, S., Tran, T.: Nesterov\u2019s smoothing technique and minimizing differences of convex functions for hierarchical clustering. Optim. Lett. 12, 455\u2013473 (2018)","journal-title":"Optim. Lett."},{"key":"578_CR40","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10898-014-0171-5","volume":"61","author":"B Ordin","year":"2015","unstructured":"Ordin, B., Bagirov, A.M.: A heuristic algorithm for solving the minimum sum-of-squares clustering problems. J. Glob. Optim. 61, 341\u2013361 (2015)","journal-title":"J. Glob. Optim."},{"key":"578_CR41","first-page":"1059","volume":"40","author":"EW Sachs","year":"2011","unstructured":"Sachs, E.W., Sachs, S.M.: Nonmonotone line searches for optimization algorithms. Control Cybernet. 40, 1059\u20131075 (2011)","journal-title":"Control Cybernet."},{"key":"578_CR42","doi-asserted-by":"publisher","first-page":"1529","DOI":"10.1007\/s11590-015-0969-1","volume":"10","author":"JCO Souza","year":"2016","unstructured":"Souza, J.C.O., Oliveira, P.R., Soubeyran, A.: Global convergence of a proximal linearized algorithm for difference of convex functions. Optim. Lett. 10, 1529\u20131539 (2016)","journal-title":"Optim. Lett."},{"key":"578_CR43","first-page":"451","volume":"21","author":"W-Y Sun","year":"2003","unstructured":"Sun, W.-Y., 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":"578_CR44","first-page":"289","volume":"22","author":"PD Tao","year":"1997","unstructured":"Tao, P.D., An, L.T.H.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam"},{"key":"578_CR45","doi-asserted-by":"crossref","unstructured":"Tao, P.D., Souad, E.B.: Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients. In: FERMAT Days 85: Mathematics for Optimization (Toulouse, 1985), vol.\u00a0129 of North-Holland Math. Stud., North-Holland, Amsterdam, pp.\u00a0249\u2013271 (1986)","DOI":"10.1016\/S0304-0208(08)72402-2"},{"key":"578_CR46","first-page":"177","volume":"60","author":"JF Toland","year":"1979","unstructured":"Toland, J.F.: On subdifferential calculus and duality in nonconvex optimization. Bull. Soc. Math. Fr. 60, 177\u2013183 (1979)","journal-title":"Bull. Soc. Math. Fr."},{"key":"578_CR47","doi-asserted-by":"publisher","first-page":"A536","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, A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"578_CR48","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14, 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00578-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00578-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00578-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T08:06:55Z","timestamp":1718179615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00578-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,11]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["578"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00578-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,11]]},"assertion":[{"value":"4 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2024","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 declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}