{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T08:41:29Z","timestamp":1764578489987,"version":"3.46.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:00:00Z","timestamp":1740441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T00:00:00Z","timestamp":1740441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PGC2018-097960-B-C22"],"award-info":[{"award-number":["PGC2018-097960-B-C22"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["PGC2018-097960-B-C22"],"award-info":[{"award-number":["PGC2018-097960-B-C22"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fondecyt Regular","award":["1240335","1220886"],"award-info":[{"award-number":["1240335","1220886"]}]},{"name":"Fondecyt Exploraci\u00f3n","award":["13220097"],"award-info":[{"award-number":["13220097"]}]},{"DOI":"10.13039\/501100016386","name":"Conselleria de Innovaci\u00f3n, Universidades, Ciencia y Sociedad Digital, Generalitat Valenciana","doi-asserted-by":"publisher","award":["AICO\/2021\/165"],"award-info":[{"award-number":["AICO\/2021\/165"]}],"id":[{"id":"10.13039\/501100016386","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PRE2019-090751"],"award-info":[{"award-number":["PRE2019-090751"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["PRE2019-090751","PID2022-136399NB-C21"],"award-info":[{"award-number":["PRE2019-090751","PID2022-136399NB-C21"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["PID2022-136399NB-C21"],"award-info":[{"award-number":["PID2022-136399NB-C21"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ANID-Chile","award":["FB210005","MATH-AMSUD 23-MATH-09"],"award-info":[{"award-number":["FB210005","MATH-AMSUD 23-MATH-09"]}]},{"name":"ANID-Chile","award":["MATH-AMSUD 23-MATH-17","ECOS-ANID ECOS320027"],"award-info":[{"award-number":["MATH-AMSUD 23-MATH-17","ECOS-ANID ECOS320027"]}]},{"name":"Fondecyt Regular","award":["1240120"],"award-info":[{"award-number":["1240120"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper we introduce the Boosted Double-proximal Subgradient Algorithm (BDSA), a novel splitting algorithm designed to address general structured nonsmooth and nonconvex mathematical programs expressed as sums and differences of composite functions. BDSA exploits the combined nature of subgradients from the data and proximal steps, and integrates a linesearch procedure to enhance its performance. While BDSA encompasses existing schemes proposed in the literature, it extends its applicability to more diverse problem domains. We establish the convergence of BDSA under the Kurdyka\u2013\u0141ojasiewicz property and provide an analysis of its convergence rate. To evaluate the effectiveness of BDSA, we introduce two novel test functions with an abundance of critical points. We conduct comparative evaluations, including algorithms with inertial terms, that illustrate its ability to effectively escape non-optimal critical points. Additionally, we present two practical applications of BDSA for testing its efficacy, namely, a constrained minimum-sum-of-squares clustering problem and a nonconvex generalization of Heron\u2019s problem.<\/jats:p>","DOI":"10.1007\/s10107-024-02190-0","type":"journal-article","created":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T09:40:11Z","timestamp":1740476411000},"page":"491-537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization"],"prefix":"10.1007","volume":"214","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2445-8011","authenticated-orcid":false,"given":"Francisco J.","family":"Arag\u00f3n-Artacho","sequence":"first","affiliation":[]},{"given":"Pedro","family":"P\u00e9rez-Aros","sequence":"additional","affiliation":[]},{"given":"David","family":"Torregrosa-Bel\u00e9n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,25]]},"reference":[{"issue":"12","key":"2190_CR1","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1080\/01630563.2022.2109171","volume":"43","author":"AH Alizadeh Tabrizian","year":"2022","unstructured":"Alizadeh Tabrizian, A.H., Bidabadi, N.: A new boosted proximal point algorithm for minimizing nonsmooth DC functions. Numer. Funct. Anal. Optim. 43(12), 1459\u20131483 (2022)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"4","key":"2190_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s11228-008-0085-9","volume":"16","author":"T Amahroq","year":"2008","unstructured":"Amahroq, T., Penot, J.-P., Syam, A.: On the subdifferentiability of the difference of two functions and local minimization. Set-Valued Anal. 16(4), 413\u2013427 (2008)","journal-title":"Set-Valued Anal."},{"issue":"1","key":"2190_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/02331934.2016.1253694","volume":"66","author":"NT An","year":"2017","unstructured":"An, N.T., Nam, N.M.: Convergence analysis of a proximal point algorithm for minimizing differences of functions. Optimization 66(1), 129\u2013147 (2017)","journal-title":"Optimization"},{"key":"2190_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11184-7","volume-title":"Nonlinear Optimization","author":"FJ Arag\u00f3n","year":"2019","unstructured":"Arag\u00f3n, F.J., Goberna, M.A., L\u00f3pez, M.A., Rodr\u00edguez, M.M.L.: Nonlinear Optimization. Springer, Cham (2019)"},{"issue":"4","key":"2190_CR5","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1007\/s11228-022-00656-x","volume":"30","author":"FJ Arag\u00f3n-Artacho","year":"2022","unstructured":"Arag\u00f3n-Artacho, F.J., Campoy, R., Vuong, P.T.: The boosted DC algorithm for linearly constrained DC programming. Set-Valued Var. Anal. 30(4), 1265\u20131289 (2022)","journal-title":"Set-Valued Var. Anal."},{"key":"2190_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10107-017-1180-1","volume":"169","author":"FJ Arag\u00f3n Artacho","year":"2018","unstructured":"Arag\u00f3n Artacho, F.J., Fleming, R.M., Vuong, P.T.: Accelerating the DC algorithm for smooth functions. Math. Program. 169, 95\u2013118 (2018)","journal-title":"Math. Program."},{"key":"2190_CR7","doi-asserted-by":"publisher","unstructured":"Arag\u00f3n-Artacho, F.J., Mordukhovich, B.S., P\u00e9rez-Aros, P.: Coderivative-based semi-Newton method in nonsmooth difference programming. Math. Program. (2024). https:\/\/doi.org\/10.1007\/s10107-024-02142-8","DOI":"10.1007\/s10107-024-02142-8"},{"issue":"1","key":"2190_CR8","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(1), 980\u20131006 (2020)","journal-title":"SIAM J. Optim."},{"key":"2190_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having Lipschitz continuous first partial derivatives. Pac. J. Math. 16, 1\u20133 (1966)","journal-title":"Pac. J. Math."},{"issue":"1\u20132","key":"2190_CR10","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.: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Program. 116(1\u20132), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"2190_CR11","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(1\u20132), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"1","key":"2190_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-018-1292-2","volume":"178","author":"S Banert","year":"2019","unstructured":"Banert, S., Bo\u0163, R.I.: A general double-proximal gradient algorithm for DC programming. Math. Program. 178(1), 301\u2013326 (2019)","journal-title":"Math. Program."},{"key":"2190_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Cham (2017)","edition":"2"},{"key":"2190_CR14","unstructured":"Bento, G.C., Mordukhovich, B.S., Mota, T.S., Nesterov, Y.: Convergence of descent methods under Kurdyka\u2013\u0141ojasiewicz properties. Preprint, arXiv:2407.00812 [math.OC] (2024)"},{"issue":"1","key":"2190_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s13675-015-0045-8","volume":"4","author":"RI Bo\u0163","year":"2016","unstructured":"Bo\u0163, R.I., Csetnek, E.R., L\u00e1szl\u00f3, S.C.: An inertial forward\u2013backward algorithm for the minimization of the sum of two nonconvex functions. EURO J. Comput. Optim. 4(1), 3\u201325 (2016)","journal-title":"EURO J. Comput. Optim."},{"issue":"1\u20132","key":"2190_CR16","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1\u20132), 459\u2013494 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"2190_CR17","doi-asserted-by":"publisher","first-page":"2541","DOI":"10.1137\/120901106","volume":"23","author":"RI Bot","year":"2013","unstructured":"Bot, R.I., Hendrich, C.: A Douglas\u2013Rachford type primal\u2013dual method for solving inclusions with mixtures of composite and parallel-sum type monotone operators. SIAM J. Optim. 23(4), 2541\u20132565 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2190_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10589-022-00395-7","volume":"83","author":"R Campoy","year":"2022","unstructured":"Campoy, R.: A product space reformulation with reduced dimension for splitting algorithms. Comput. Optim. Appl. 83(1), 319\u2013348 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"2190_CR19","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1088\/0266-5611\/23\/4\/008","volume":"23","author":"C Chaux","year":"2007","unstructured":"Chaux, C., Combettes, P.L., Pesquet, J.-C., Wajs, V.R.: A variational formulation for frame-based inverse problems. Inverse Prob. 23(4), 1495\u20131518 (2007)","journal-title":"Inverse Prob."},{"issue":"1\u20132","key":"2190_CR20","first-page":"117","volume":"2","author":"FH Clarke","year":"1995","unstructured":"Clarke, F.H., Stern, R.J., Wolenski, P.R.: Proximal smoothness and the lower-$$C^2$$ property. J. Convex Anal. 2(1\u20132), 117\u2013144 (1995)","journal-title":"J. Convex Anal."},{"issue":"1","key":"2190_CR21","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1137\/19M1303320","volume":"31","author":"R Correa","year":"2021","unstructured":"Correa, R., L\u00f3pez, M.A., P\u00e9rez-Aros, P.: Necessary and sufficient optimality conditions in DC semi-infinite programming. SIAM J. Optim. 31(1), 837\u2013865 (2021)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2190_CR22","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1007\/s10957-023-02260-x","volume":"198","author":"R Correa","year":"2023","unstructured":"Correa, R., L\u00f3pez, M.A., P\u00e9rez-Aros, P.: Optimality conditions in DC-constrained mathematical programming problems. J. Optim. Theory Appl. 198(3), 1191\u20131225 (2023)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"2190_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(4), 679\u2013706 (2020)","journal-title":"Set-Valued Var. Anal."},{"issue":"4","key":"2190_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(4), 895\u2013919 (2019)","journal-title":"Set-Valued Var. Anal."},{"key":"2190_CR25","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. II. Springer, New York (2003)"},{"issue":"3","key":"2190_CR26","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s10589-024-00578-4","volume":"88","author":"OP Ferreira","year":"2024","unstructured":"Ferreira, O.P., Santos, E.M., Souza, J.C.O.: A boosted DC algorithm for non-differentiable DC components with non-monotone line search. Comput. Optim. Appl. 88(3), 783\u2013818 (2024)","journal-title":"Comput. Optim. Appl."},{"key":"2190_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04247-3","volume-title":"Newton-Type Methods for Optimization and Variational Problems","author":"AF Izmailov","year":"2014","unstructured":"Izmailov, A.F., Solodov, M.V.: Newton-Type Methods for Optimization and Variational Problems. Springer, Cham (2014)"},{"issue":"3","key":"2190_CR28","doi-asserted-by":"publisher","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Ann. Inst. Fourier 48(3), 769\u2013783 (1998)","journal-title":"Ann. Inst. Fourier"},{"key":"2190_CR29","unstructured":"\u0141ojasiewicz, S.: Ensembles semi-analytiques. Institut des Hautes Etudes Scientifiques, Bures-sur-Yvette (Seine-et-Oise), France (1965)"},{"issue":"3","key":"2190_CR30","doi-asserted-by":"publisher","first-page":"1798","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(3), 1798\u20131823 (2015)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"2190_CR31","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/060655183","volume":"19","author":"P-E Maing\u00e9","year":"2008","unstructured":"Maing\u00e9, P.-E., Moudafi, A.: Convergence of new inertial proximal methods for DC programming. SIAM J. Optim. 19(1), 397\u2013413 (2008)","journal-title":"SIAM J. Optim."},{"key":"2190_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31246-3","volume-title":"Variational Analysis and Generalized Differentiation I","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation I. Springer, Berlin (2006)"},{"key":"2190_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-92775-6","volume-title":"Variational Analysis and Applications","author":"BS Mordukhovich","year":"2018","unstructured":"Mordukhovich, B.S.: Variational Analysis and Applications. Springer, Cham (2018)"},{"issue":"10","key":"2190_CR34","doi-asserted-by":"publisher","first-page":"1915","DOI":"10.1080\/00036811.2011.604849","volume":"91","author":"BS Mordukhovich","year":"2012","unstructured":"Mordukhovich, B.S., Nam, N.M., Salinas, J.: Applications of variational analysis to a generalized Heron problem. Appl. Anal. 91(10), 1915\u20131942 (2012)","journal-title":"Appl. Anal."},{"issue":"2","key":"2190_CR35","doi-asserted-by":"publisher","first-page":"87","DOI":"10.4169\/amer.math.monthly.119.02.087","volume":"119","author":"BS Mordukhovich","year":"2012","unstructured":"Mordukhovich, B.S., Nam, N.M., Salinas, J.: Solving a generalized Heron problem by means of convex analysis. Am. Math. Mon. 119(2), 87\u201399 (2012)","journal-title":"Am. Math. Mon."},{"issue":"2","key":"2190_CR36","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s10957-013-0391-8","volume":"160","author":"D Noll","year":"2014","unstructured":"Noll, D.: Convergence of non-smooth descent methods using the Kurdyka\u2013\u0141ojasiewicz inequality. J. Optim. Theory Appl. 160(2), 553\u2013572 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2190_CR37","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(2), 341\u2013361 (2015)","journal-title":"J. Glob. Optim."},{"key":"2190_CR38","doi-asserted-by":"crossref","unstructured":"Pham, T.N., Dao, M.N., Shah, R., Sultanova, N., Li, G., Islam, S.: A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems. Numer. Algorithms 94, 1763\u20131795 (2023)","DOI":"10.1007\/s11075-023-01554-5"},{"key":"2190_CR39","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.A. (eds.) Transactions on Computational Intelligence XIII, pp. 1\u201337. Springer, Berlin (2014)"},{"key":"2190_CR40","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":"2190_CR41","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, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"issue":"7","key":"2190_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(7), 1529\u20131539 (2016)","journal-title":"Optim. Lett."},{"key":"2190_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":"2190_CR44","doi-asserted-by":"crossref","unstructured":"Tao, P.D., 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, vol.\u00a0129 of North-Holland Mathematics Studies, pp.\u00a0249\u2013271. North-Holland, Springer (1986)","DOI":"10.1016\/S0304-0208(08)72402-2"},{"issue":"3","key":"2190_CR45","doi-asserted-by":"publisher","first-page":"2557","DOI":"10.1007\/s00245-020-09718-8","volume":"84","author":"TT Truong","year":"2021","unstructured":"Truong, T.T., Nguyen, H.-T.: Backtracking gradient descent method and some applications in large scale optimisation. Part 2: Algorithms and experiments. Appl. Math. Optim. 84(3), 2557\u20132586 (2021)","journal-title":"Appl. Math. Optim."},{"key":"2190_CR46","doi-asserted-by":"publisher","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, 297\u2013324 (2018)","journal-title":"Comput. Optim. Appl."},{"key":"2190_CR47","doi-asserted-by":"publisher","first-page":"69883","DOI":"10.1109\/ACCESS.2018.2880454","volume":"6","author":"F Wen","year":"2018","unstructured":"Wen, F., Chu, L., Liu, P., Qiu, R.C.: A survey on nonconvex regularization-based sparse and low-rank recovery in signal processing, statistics, and machine learning. IEEE Access 6, 69883\u201369906 (2018)","journal-title":"IEEE Access"},{"issue":"5A","key":"2190_CR48","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1214\/08-AOS659","volume":"37","author":"T Zhang","year":"2009","unstructured":"Zhang, T.: Some sharp performance bounds for least squares regression with $$l_1$$ regularization. Ann. Stat. 37(5A), 2109\u20132144 (2009)","journal-title":"Ann. Stat."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02190-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02190-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02190-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T08:39:25Z","timestamp":1764578365000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02190-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,25]]},"references-count":48,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["2190"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02190-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2025,2,25]]},"assertion":[{"value":"4 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2025","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}