{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T11:15:56Z","timestamp":1771326956856,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T00:00:00Z","timestamp":1746403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T00:00:00Z","timestamp":1746403200000},"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 Sci Comput"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10915-025-02904-2","type":"journal-article","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T06:20:52Z","timestamp":1746426052000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria"],"prefix":"10.1007","volume":"103","author":[{"given":"Lei","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4396-2146","authenticated-orcid":false,"given":"Jingjing","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"issue":"3","key":"2904_CR1","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1137\/16M1084754","volume":"27","author":"M Ahn","year":"2017","unstructured":"Ahn, M., Pang, J.-S., Xin, J.: Difference-of-convex learning: directional stationarity, optimality, and sparsity. SIAM J. Optim. 27(3), 1637\u20131665 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2904_CR2","doi-asserted-by":"crossref","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), 5\u201316 (2009)","journal-title":"Math. Program."},{"issue":"2","key":"2904_CR3","doi-asserted-by":"crossref","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(2), 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2904_CR4","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\u2013backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137(1), 91\u2013129 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"2904_CR5","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.2016.0817","volume":"42","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Bolte, J., Teboulle, M.: A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications. Math. Oper. Res. 42(2), 330\u2013348 (2017)","journal-title":"Math. Oper. Res."},{"key":"2904_CR6","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, vol. 408. Springer, Berlin (2011)","DOI":"10.1007\/978-1-4419-9467-7"},{"issue":"1","key":"2904_CR7","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. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"issue":"4","key":"2904_CR8","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2007","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.: The \u0141ojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J. Optim. 17(4), 1205\u20131223 (2007)","journal-title":"SIAM J. Optim."},{"key":"2904_CR9","doi-asserted-by":"crossref","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146, 459\u2013494 (2014)","DOI":"10.1007\/s10107-013-0701-9"},{"issue":"3","key":"2904_CR10","doi-asserted-by":"crossref","first-page":"2131","DOI":"10.1137\/17M1138558","volume":"28","author":"J Bolte","year":"2018","unstructured":"Bolte, J., Sabach, S., Teboulle, M., Vaisbourd, Y.: First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems. SIAM J. Optim. 28(3), 2131\u20132151 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2904_CR11","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7(3), 200\u2013217 (1967)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"18","key":"2904_CR12","doi-asserted-by":"crossref","first-page":"4826","DOI":"10.1109\/TSP.2018.2862399","volume":"66","author":"H-H Chao","year":"2018","unstructured":"Chao, H.-H., Vandenberghe, L.: Entropic proximal operators for nonnegative trigonometric polynomials. IEEE Trans. Signal Process. 66(18), 4826\u20134838 (2018)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"2904_CR13","doi-asserted-by":"crossref","first-page":"3344","DOI":"10.1137\/18M117337X","volume":"28","author":"Y Cui","year":"2018","unstructured":"Cui, Y., Pang, J.-S., Sen, B.: Composite difference-max programs for modern statistical estimation problems. SIAM J. Optim. 28(4), 3344\u20133374 (2018)","journal-title":"SIAM J. Optim."},{"issue":"456","key":"2904_CR14","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(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"2904_CR15","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: International Conference on Machine Learning, pp. 37\u201345 (2013)"},{"issue":"1","key":"2904_CR16","doi-asserted-by":"crossref","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(1), 141\u2013176 (2018)","journal-title":"Math. Program."},{"key":"2904_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06409-2","volume-title":"Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods. Springer, Berlin (1993)"},{"issue":"1","key":"2904_CR18","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":"2904_CR19","unstructured":"Kelly, M., Longjohn, R., Nottingham, K.: The UCI machine learning repository. https:\/\/archive.ics.uci.edu"},{"issue":"1","key":"2904_CR20","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Pham, D.T.: DC programming and DCA: thirty years of developments. Math. Program. 169(1), 5\u201368 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"2904_CR21","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s10898-023-01272-1","volume":"88","author":"HA Le Thi","year":"2024","unstructured":"Le Thi, H.A., Pham, D.T.: Open issues and recent advances in DC programming and DCA. J. Glob. Optim. 88(3), 533\u2013590 (2024)","journal-title":"J. Glob. Optim."},{"key":"2904_CR22","unstructured":"Li, H., Lin, Z.: Accelerated proximal gradient methods for nonconvex programming. In: Advances in Neural Information Processing Systems, pp. 379\u2013387 (2015)"},{"issue":"1","key":"2904_CR23","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D.F., Toh, K.-C.: A highly efficient semismooth Newton augmented Lagrangian method for solving Lasso problems. SIAM J. Optim. 28(1), 433\u2013458 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2904_CR24","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s10589-017-9900-2","volume":"67","author":"T Liu","year":"2017","unstructured":"Liu, T., Pong, T.K.: Further properties of the forward\u2013backward envelope with applications to difference-of-convex programming. Comput. Optim. Appl. 67(3), 489\u2013520 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2904_CR25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10589-022-00357-z","volume":"82","author":"T Liu","year":"2022","unstructured":"Liu, T., Takeda, A.: An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems. Comput. Optim. Appl. 82(1), 141\u2013173 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"2904_CR26","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 $$L_1$$ and $$L_2$$. J. Sci. Comput. 64(1), 178\u2013196 (2015)","journal-title":"J. Sci. Comput."},{"issue":"1","key":"2904_CR27","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1137\/16M1099546","volume":"28","author":"H Lu","year":"2018","unstructured":"Lu, H., Freund, M.R., Nesterov, Y.: Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28(1), 333\u2013354 (2018)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2904_CR28","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(4), 2725\u20132752 (2019)","journal-title":"SIAM J. Optim."},{"key":"2904_CR29","doi-asserted-by":"crossref","unstructured":"Lu, Z., Zhou, Z., Sun, Z.: Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization. Math. Program. 176, 369\u2013401 (2019)","DOI":"10.1007\/s10107-018-1318-9"},{"issue":"5\u20136","key":"2904_CR30","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1080\/02331930600816395","volume":"55","author":"BS Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.S., Nam, N.M., Yen, N.D.: Fr\u00e9chet subdifferential calculus and optimality conditions in nondifferentiable programming. Optimization 55(5\u20136), 685\u2013708 (2006)","journal-title":"Optimization"},{"issue":"2","key":"2904_CR31","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/s10589-023-00525-9","volume":"87","author":"S Nakayama","year":"2024","unstructured":"Nakayama, S., Narushima, Y., Yabe, H.: Inexact proximal DC Newton-type method for nonconvex composite functions. Comput. Optim. Appl. 87(2), 611\u2013640 (2024)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2904_CR32","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate $$O(1\/k^2)$$. Sov. Math. Doklady 27(2), 372\u2013376 (1983)","journal-title":"Sov. Math. Doklady"},{"key":"2904_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Boston (2004)"},{"issue":"1","key":"2904_CR34","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"2904_CR35","doi-asserted-by":"crossref","unstructured":"Oliveira, W., Tcheou, M.P.: An inertial algorithm for DC programming. Set-Valued Var. Anal. 27(4), 895\u2013919 (2019)","DOI":"10.1007\/s11228-018-0497-0"},{"issue":"1","key":"2904_CR36","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":"1","key":"2904_CR37","first-page":"289","volume":"22","author":"DT Pham","year":"1997","unstructured":"Pham, D.T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietnam 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam"},{"issue":"2","key":"2904_CR38","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"DT Pham","year":"1998","unstructured":"Pham, D.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":"2904_CR39","doi-asserted-by":"crossref","unstructured":"Phan, D.N., Le Thi, H.A.: Difference-of-convex algorithm with extrapolation for nonconvex, nonsmooth optimization problems. Math. Oper. Res. 49(3),1973\u20131985 (2023)","DOI":"10.1287\/moor.2020.0393"},{"key":"2904_CR40","doi-asserted-by":"crossref","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":"2904_CR41","doi-asserted-by":"crossref","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)"},{"key":"2904_CR42","unstructured":"Romain, M., d\u2019Aspremont, A.: A Bregman method for structure learning on sparse directed acyclic graphs. arXiv preprint arXiv:2011.02764, (2020)"},{"key":"2904_CR43","doi-asserted-by":"crossref","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)","DOI":"10.1007\/s11590-015-0969-1"},{"key":"2904_CR44","unstructured":"Sun, W.Y., Sampaio, R.J.B., Candido, M.A.B.: Proximal point algorithm for minimization of DC function. J. Comput. Math. 21(4), 451\u2013462 (2003)"},{"issue":"3","key":"2904_CR45","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1007\/s10589-022-00411-w","volume":"83","author":"S Takahashi","year":"2022","unstructured":"Takahashi, S., Fukuda, M., Tanaka, M.: New Bregman proximal type algorithms for solving DC optimization problems. Comput. Optim. Appl. 83(3), 893\u2013931 (2022)","journal-title":"Comput. Optim. Appl."},{"key":"2904_CR46","doi-asserted-by":"crossref","first-page":"108734","DOI":"10.1016\/j.sigpro.2022.108734","volume":"202","author":"S Takahashi","year":"2023","unstructured":"Takahashi, S., Tanaka, M., Ikeda, S.: Blind deconvolution with non-smooth regularization via Bregman proximal DCAs. Signal Process. 202, 108734 (2023)","journal-title":"Signal Process."},{"issue":"226","key":"2904_CR47","first-page":"1","volume":"21","author":"P Tang","year":"2020","unstructured":"Tang, P., Wang, C., Sun, D.F., Toh, K.-C.: A sparse semismooth Newton based proximal majorization-minimization algorithm for nonconvex square-root-loss regression problems. J. Mach. Learn. Res. 21(226), 1\u201338 (2020)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"2904_CR48","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10107-018-1284-2","volume":"170","author":"M Teboulle","year":"2018","unstructured":"Teboulle, M.: A simplified view of first order methods for optimization. Math. Program. 170(1), 67\u201396 (2018)","journal-title":"Math. Program."},{"issue":"2","key":"2904_CR49","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1137\/080714488","volume":"31","author":"E Van Den Berg","year":"2009","unstructured":"Van Den Berg, E., Friedlander, M.P.: Probing the Pareto frontier for basis pursuit solutions. SIAM J. Sci. Comput. 31(2), 890\u2013912 (2009)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"2904_CR50","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":"2904_CR51","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s10957-023-02348-4","volume":"200","author":"L Yang","year":"2024","unstructured":"Yang, L.: Proximal gradient method with extrapolation and line search for a class of nonconvex and nonsmooth problems. J. Optim. Theory Appl. 200(1), 68\u2013103 (2024)","journal-title":"J. Optim. Theory Appl."},{"key":"2904_CR52","doi-asserted-by":"publisher","unstructured":"Yang, L., Toh, K.-C.: Inexact Bregman proximal gradient method and its inertial variant with absolute and partial relative stopping criteria. Math. Oper. Res. (2025). https:\/\/doi.org\/10.1287\/moor.2023.0328","DOI":"10.1287\/moor.2023.0328"},{"issue":"1","key":"2904_CR53","doi-asserted-by":"crossref","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(1), A536\u2013A563 (2015)","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"2904_CR54","doi-asserted-by":"crossref","first-page":"2024","DOI":"10.1137\/20M1314057","volume":"31","author":"P Yu","year":"2021","unstructured":"Yu, P., Pong, T.K., Lu, Z.: Convergence rate analysis of a sequential convex programming method with line search for a class of constrained difference-of-convex optimization problems. SIAM J. Optim. 31(3), 2024\u20132054 (2021)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2904_CR55","first-page":"894","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang, C.-H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38(2), 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"issue":"3","key":"2904_CR56","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T.: Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res. 11(3), 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"2904_CR57","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/s10444-022-10002-2","volume":"49","author":"Y Zhang","year":"2023","unstructured":"Zhang, Y., Li, G., Pong, T.K., Xu, S.: Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints. Adv. Comput. Math. 49, 8 (2023)","journal-title":"Adv. Comput. Math."},{"key":"2904_CR58","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-025-00680-1","author":"Y Zhang","year":"2025","unstructured":"Zhang, Y., Pong, T.K., Xu, S.: An extended sequential quadratic method with extrapolation. Comput. Optim. Appl. (2025). https:\/\/doi.org\/10.1007\/s10589-025-00680-1","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"2904_CR59","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1080\/10556788.2023.2269594","volume":"39","author":"Y Zhang","year":"2024","unstructured":"Zhang, Y., Toh, K.-C., Sun, D.F.: Learning graph Laplacian with MCP. Optim. Methods Softw. 39(3), 569\u2013600 (2024)","journal-title":"Optim. Methods Softw."},{"key":"2904_CR60","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2024.2314241","author":"Y Zhang","year":"2024","unstructured":"Zhang, Y., Yamada, I.: An inexact proximal linearized DC algorithm with provably terminating inner loop. Optimization (2024). https:\/\/doi.org\/10.1080\/02331934.2024.2314241","journal-title":"Optimization"},{"key":"2904_CR61","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhang, N., Sun, D.F., Toh, K.-C.: An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems. Math. Program. 179, 223\u2013263 (2020)","DOI":"10.1007\/s10107-018-1329-6"},{"issue":"4","key":"2904_CR62","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X-Y Zhao","year":"2010","unstructured":"Zhao, X.-Y., Sun, D.F., Toh, K.-C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20(4), 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02904-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02904-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02904-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T13:20:19Z","timestamp":1748006419000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02904-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,5]]},"references-count":62,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["2904"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02904-2","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,5]]},"assertion":[{"value":"8 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2025","order":4,"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"}}],"article-number":"91"}}