{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T15:27:44Z","timestamp":1749655664498,"version":"3.37.3"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T00:00:00Z","timestamp":1714780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T00:00:00Z","timestamp":1714780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2023A1515012026"],"award-info":[{"award-number":["2023A1515012026"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10915-024-02549-7","type":"journal-article","created":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T11:01:33Z","timestamp":1714820493000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-Quadratic Regularized Optimal Transport Problems"],"prefix":"10.1007","volume":"99","author":[{"given":"Lei","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0671-9561","authenticated-orcid":false,"given":"Ling","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Hong T. M.","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,4]]},"reference":[{"issue":"03","key":"2549_CR1","doi-asserted-by":"crossref","first-page":"1950002","DOI":"10.1142\/S021902491950002X","volume":"22","author":"A Alfonsi","year":"2019","unstructured":"Alfonsi, A., Corbetta, J., Jourdain, B.: Sampling of one-dimensional probability measures in the convex order and computation of robust option price bounds. Int. J. Theor. Appl. Financ. 22(03), 1950002 (2019)","journal-title":"Int. J. Theor. Appl. Financ."},{"key":"2549_CR2","unstructured":"Altschuler, J., Weed, J., Rigollet, P.: Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. In: Advances in Neural Information Processing Systems 30 (2017)"},{"key":"2549_CR3","unstructured":"Arjovsky, M., Chintala, S., Bottou, L.: Wasserstein generative adversarial networks. In: International Conference on Machine Learning, vol. 70, pp. 214\u2013223 (2017)"},{"key":"2549_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, vol. 408. Springer, Cham (2011)"},{"key":"2549_CR5","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/s00780-013-0205-8","volume":"17","author":"M Beiglb\u00f6ck","year":"2013","unstructured":"Beiglb\u00f6ck, M., Henry-Labordere, P., Penkner, F.: Model-independent bounds for option prices-a mass transport approach. Financ. Stoch. 17, 477\u2013501 (2013)","journal-title":"Financ. Stoch."},{"issue":"1","key":"2549_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1214\/14-AOP966","volume":"44","author":"M Beiglb\u00f6ck","year":"2016","unstructured":"Beiglb\u00f6ck, M., Juillet, N.: On a problem of optimal transport under marginal martingale constraints. Ann. Probab. 44(1), 42\u2013106 (2016)","journal-title":"Ann. Probab."},{"issue":"2","key":"2549_CR7","doi-asserted-by":"crossref","first-page":"A1111","DOI":"10.1137\/141000439","volume":"37","author":"J-D Benamou","year":"2015","unstructured":"Benamou, J.-D., Carlier, G., Cuturi, M., Nenna, L., Peyr\u00e9, G.: Iterative Bregman projections for regularized transportation problems. SIAM J. Sci. Comput. 37(2), A1111\u2013A1138 (2015)","journal-title":"SIAM J. Sci. Comput."},{"key":"2549_CR8","unstructured":"Blondel, M., Seguy, V., Rolet, A.: Smooth and sparse optimal transport. In: International Conference on Artificial Intelligence and Statistics, vol. 84, pp. 880\u2013889 (2018)"},{"issue":"4","key":"2549_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3306346.3323021","volume":"38","author":"N Bonneel","year":"2019","unstructured":"Bonneel, N., Coeurjolly, D.: Spot: sliced partial optimal transport. ACM Trans. Graph. 38(4), 1\u201313 (2019)","journal-title":"ACM Trans. Graph."},{"key":"2549_CR10","doi-asserted-by":"crossref","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends\u00ae in Machine learning 3(1), 1\u2013122 (2011)","DOI":"10.1561\/2200000016"},{"key":"2549_CR11","unstructured":"Brauer, C., Clason, C., Lorenz, D., Wirth, B.: A Sinkhorn-Newton method for entropic optimal transport. arXiv preprint arXiv:1710.06635 (2017)"},{"issue":"2","key":"2549_CR12","doi-asserted-by":"crossref","first-page":"673","DOI":"10.4007\/annals.2010.171.673","volume":"171","author":"LA Caffarelli","year":"2010","unstructured":"Caffarelli, L.A., McCann, R.J.: Free boundaries in optimal transport and Monge-Ampere obstacle problems. Ann. Math. 171(2), 673\u2013730 (2010)","journal-title":"Ann. Math."},{"issue":"1\u20132","key":"2549_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10107-019-01423-x","volume":"185","author":"L Chen","year":"2021","unstructured":"Chen, L., Li, X., Sun, D.F., Toh, K.-C.: On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming. Math. Program. 185(1\u20132), 111\u2013161 (2021)","journal-title":"Math. Program."},{"key":"2549_CR14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s10107-016-1007-5","volume":"161","author":"L Chen","year":"2017","unstructured":"Chen, L., Sun, D.F., Toh, K.-C.: An efficient inexact symmetric Gauss\u2013Seidel based majorized ADMM for high-dimensional convex composite conic programming. Math. Program. 161, 237\u2013270 (2017)","journal-title":"Math. Program."},{"issue":"1","key":"2549_CR15","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10589-023-00459-2","volume":"85","author":"HTM Chu","year":"2023","unstructured":"Chu, H.T.M., Liang, L., Toh, K.-C., Yang, L.: An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems. Comput. Optim. Appl. 85(1), 107\u2013146 (2023)","journal-title":"Comput. Optim. Appl."},{"key":"2549_CR16","doi-asserted-by":"crossref","unstructured":"Courty, N., Flamary, R., Tuia, D.: Domain adaptation with regularized optimal transport. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 274\u2013289 (2014)","DOI":"10.1007\/978-3-662-44848-9_18"},{"issue":"9","key":"2549_CR17","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1109\/TPAMI.2016.2615921","volume":"39","author":"N Courty","year":"2016","unstructured":"Courty, N., Flamary, R., Tuia, D., Rakotomamonjy, A.: Optimal transport for domain adaptation. IEEE Trans. Pattern Anal. Mach. Intell. 39(9), 1853\u20131865 (2016)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"2549_CR18","first-page":"2292","volume":"26","author":"M Cuturi","year":"2013","unstructured":"Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. Adv. Neural Inf. Process. Syst. 26, 2292\u20132300 (2013)","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"2549_CR19","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1137\/15M1032600","volume":"9","author":"M Cuturi","year":"2016","unstructured":"Cuturi, M., Peyr\u00e9, G.: A smoothed dual approach for variational Wasserstein problems. SIAM J. Imaging Sci. 9(1), 320\u2013343 (2016)","journal-title":"SIAM J. Imaging Sci."},{"issue":"15","key":"2549_CR20","first-page":"1","volume":"19","author":"A Dessein","year":"2018","unstructured":"Dessein, A., Papadakis, N., Rouas, J.-L.: Regularized optimal transport and the rot mover\u2019s distance. J. Mach. Learn. Res. 19(15), 1\u201353 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"2549_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/9781108591034","volume-title":"Probability: Theory and Examples","author":"R Durrett","year":"2019","unstructured":"Durrett, R.: Probability: Theory and Examples, vol. 49. Cambridge University Press, Cambridge (2019)"},{"key":"2549_CR22","unstructured":"Dvurechensky, P., Gasnikov, A., Kroshnin, A.: Computational optimal transport: complexity by accelerated gradient descent is better than by Sinkhorn\u2019s algorithm. In: Proceedings of the 35th International Conference on Machine Learning, vol. 80, pp. 1367\u20131376 (2018)"},{"issue":"1","key":"2549_CR23","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10107-012-0528-9","volume":"141","author":"J Eckstein","year":"2013","unstructured":"Eckstein, J., Silva, P.J.S.: A practical relative error criterion for augmented Lagrangians. Math. Program. 141(1), 319\u2013348 (2013)","journal-title":"Math. Program."},{"issue":"4","key":"2549_CR24","doi-asserted-by":"crossref","first-page":"A1961","DOI":"10.1137\/17M1132665","volume":"40","author":"M Essid","year":"2018","unstructured":"Essid, M., Solomon, J.: Quadratically regularized optimal transport on graphs. SIAM J. Sci. Comput. 40(4), A1961\u2013A1986 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"2549_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. Springer, New York (2003)"},{"issue":"3","key":"2549_CR26","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1137\/130929886","volume":"7","author":"S Ferradans","year":"2014","unstructured":"Ferradans, S., Papadakis, N., Peyr\u00e9, G., Aujol, J.-F.: Regularized discrete optimal transport. SIAM J. Imaging Sci. 7(3), 1853\u20131882 (2014)","journal-title":"SIAM J. Imaging Sci."},{"key":"2549_CR27","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s00205-008-0212-7","volume":"195","author":"A Figalli","year":"2010","unstructured":"Figalli, A.: The optimal partial transport problem. Arch. Ration. Mech. Anal. 195, 533\u2013560 (2010)","journal-title":"Arch. Ration. Mech. Anal."},{"key":"2549_CR28","unstructured":"Flamary, R., Courty, N., Rakotomamonjy, A., Tuia, D.: Optimal transport with Laplacian regularization. In: NIPS 2014, Workshop on Optimal Transport and Machine Learning (2014)"},{"issue":"1","key":"2549_CR29","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"2549_CR30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/(SICI)1097-0312(199801)51:1<23::AID-CPA2>3.0.CO;2-H","volume":"51","author":"W Gangbo","year":"1998","unstructured":"Gangbo, W., \u015awi\u0229ch, A.: Optimal maps for the multidimensional Monge\u2013Kantorovich problem. Commun. Pure Appl. Math. 51(1), 23\u201345 (1998)","journal-title":"Commun. Pure Appl. Math."},{"issue":"6","key":"2549_CR31","first-page":"3311","volume":"29","author":"G Guo","year":"2019","unstructured":"Guo, G., Ob\u0142\u00f3j, J.: Computational methods for martingale optimal transport problems. Ann. Appl. Probab. 29(6), 3311\u20133347 (2019)","journal-title":"Ann. Appl. Probab."},{"issue":"1","key":"2549_CR32","first-page":"31","volume":"22","author":"D Hobson","year":"2012","unstructured":"Hobson, D., Neuberger, A.: Robust bounds for forward start options. Math. Financ. Int. J. Math. Stat. Financ. Econ. 22(1), 31\u201356 (2012)","journal-title":"Math. Financ. Int. J. Math. Stat. Financ. Econ."},{"key":"2549_CR33","first-page":"199","volume":"37","author":"LV Kantorovich","year":"1942","unstructured":"Kantorovich, L.V.: On the translocation of masses. Dokl. Akad. Nauk. USSR (NS) 37, 199\u2013201 (1942)","journal-title":"Dokl. Akad. Nauk. USSR (NS)"},{"key":"2549_CR34","doi-asserted-by":"crossref","unstructured":"Kim, J., Monteiro, R.D.C., Park, H.: Group sparsity in nonnegative matrix factorization. In: SIAM International Conference on Data Mining, pp. 851\u2013862 (2012)","DOI":"10.1137\/1.9781611972825.73"},{"key":"2549_CR35","doi-asserted-by":"crossref","unstructured":"Kuhn, D., Esfahani, P.M., Nguyen, V.A., Shafieezadeh-Abadeh, S.: Wasserstein distributionally robust optimization: theory and applications in machine learning. arXiv preprint arXiv:1908.08729, (2019)","DOI":"10.1287\/educ.2019.0198"},{"key":"2549_CR36","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1515\/9783112479926-011","volume":"45","author":"B Kummer","year":"1988","unstructured":"Kummer, B.: Newton\u2019s method for non-differentiable functions. Adv. Math. Optim. 45, 114\u2013125 (1988)","journal-title":"Adv. Math. Optim."},{"issue":"2","key":"2549_CR37","doi-asserted-by":"crossref","first-page":"1842","DOI":"10.1137\/17M1136390","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D.F., Toh, K.-C.: On efficiently solving the subproblems of a level-set method for fused lasso problems. SIAM J. Optim. 28(2), 1842\u20131866 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"2549_CR38","doi-asserted-by":"crossref","first-page":"2410","DOI":"10.1137\/19M1251795","volume":"30","author":"X Li","year":"2020","unstructured":"Li, X., Sun, D.F., Toh, K.-C.: An asymptotically superlinearly convergent semismooth Newton augmented Lagrangian method for linear programming. SIAM J. Optim. 30(3), 2410\u20132440 (2020)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"2549_CR39","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10107-018-1342-9","volume":"179","author":"X Li","year":"2020","unstructured":"Li, X., Sun, D.F., Toh, K.-C.: On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope. Math. Program. 179(1\u20132), 419\u2013446 (2020)","journal-title":"Math. Program."},{"issue":"3","key":"2549_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3476571","volume":"48","author":"L Liang","year":"2022","unstructured":"Liang, L., Li, X., Sun, D.F., Toh, K.-C.: Qppal: a two-phase proximal augmented Lagrangian method for high-dimensional convex quadratic programming problems. ACM Trans. Math. Softw. 48(3), 1\u201327 (2022)","journal-title":"ACM Trans. Math. Softw."},{"issue":"65","key":"2549_CR41","first-page":"1","volume":"23","author":"T Lin","year":"2022","unstructured":"Lin, T., Ho, N., Cuturi, M., Jordan, M.I.: On the complexity of approximating multimarginal optimal transport. J. Mach. Learn. Res. 23(65), 1\u201343 (2022)","journal-title":"J. Mach. Learn. Res."},{"issue":"137","key":"2549_CR42","first-page":"1","volume":"23","author":"T Lin","year":"2022","unstructured":"Lin, T., Ho, N., Jordan, M.I.: On the efficiency of entropic regularized algorithms for optimal transport. J. Mach. Learn. Res. 23(137), 1\u201342 (2022)","journal-title":"J. Mach. Learn. Res."},{"key":"2549_CR43","doi-asserted-by":"crossref","first-page":"1919","DOI":"10.1007\/s00245-019-09614-w","volume":"83","author":"DA Lorenz","year":"2021","unstructured":"Lorenz, D.A., Manns, P., Meyer, C.: Quadratically regularized optimal transport. Appl. Math. Optim. 83, 1919\u20131949 (2021)","journal-title":"Appl. Math. Optim."},{"key":"2549_CR44","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.neucom.2021.04.124","volume":"454","author":"W Lu","year":"2021","unstructured":"Lu, W., Chen, Y., Wang, J., Qin, X.: Cross-domain activity recognition via substructural optimal transport. Neurocomputing 454, 65\u201375 (2021)","journal-title":"Neurocomputing"},{"key":"2549_CR45","unstructured":"De March, H.: Entropic approximation for multi-dimensional martingale optimal transport. arXiv preprint arXiv:1812.11104, (2018)"},{"issue":"6","key":"2549_CR46","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1137\/0315061","volume":"15","author":"R Mifflin","year":"1977","unstructured":"Mifflin, R.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. 15(6), 959\u2013972 (1977)","journal-title":"SIAM J. Control Optim."},{"key":"2549_CR47","unstructured":"Monge, G.: M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. In Histoire de l\u2019Acad\u00e9mie Royale des Sciences de Paris, pp. 666\u2013704 (1781)"},{"key":"2549_CR48","doi-asserted-by":"crossref","unstructured":"Montesuma, E.F., Mboula, F.M.N.: Wasserstein barycenter for multi-source domain adaptation. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 16785\u201316793 (2021)","DOI":"10.1109\/CVPR46437.2021.01651"},{"issue":"1","key":"2549_CR49","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/070688146","volume":"19","author":"LA Parente","year":"2008","unstructured":"Parente, L.A., Lotito, P.A., Solodov, M.V.: A class of inexact variable metric proximal point algorithms. SIAM J. Optim. 19(1), 240\u2013260 (2008)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"2549_CR50","doi-asserted-by":"crossref","first-page":"1771","DOI":"10.1051\/m2an\/2015020","volume":"49","author":"B Pass","year":"2015","unstructured":"Pass, B.: Multi-marginal optimal transport: theory and applications. ESAIM: Math. Model. Numer. Anal. 49(6), 1771\u20131790 (2015)","journal-title":"ESAIM: Math. Model. Numer. Anal."},{"key":"2549_CR51","volume-title":"Introduction to Optimization","author":"BT Polyak","year":"1987","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software Inc., New York (1987)"},{"key":"2549_CR52","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L Qi","year":"1993","unstructured":"Qi, L., Sun, J.: A nonsmooth version of Newton\u2019s method. Math. Program. 58, 353\u2013367 (1993)","journal-title":"Math. Program."},{"key":"2549_CR53","unstructured":"Redko, I., Courty, N., Flamary, R., Tuia, D.: Optimal transport for multi-source domain adaptation under target shift. In International Conference on Artificial Intelligence and Statistics, vol. 89, pp. 849\u2013858 (2019)"},{"key":"2549_CR54","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"2549_CR55","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Conjugate Duality and Optimization. SIAM, Philadelphia (1974)","DOI":"10.1137\/1.9781611970524"},{"key":"2549_CR56","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","DOI":"10.1137\/0314056"},{"key":"2549_CR57","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer (1998)","DOI":"10.1007\/978-3-642-02431-3"},{"issue":"2","key":"2549_CR58","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y Rubner","year":"2000","unstructured":"Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover\u2019s distance as a metric for image retrieval. Int. J. Comput. Vis. 40(2), 99\u2013121 (2000)","journal-title":"Int. J. Comput. Vis."},{"key":"2549_CR59","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1109\/ACCESS.2016.2639065","volume":"5","author":"J Schrieber","year":"2016","unstructured":"Schrieber, J., Schuhmacher, D., Gottschlich, C.: Dotmark-A benchmark for discrete optimal transport. IEEE Access 5, 271\u2013282 (2016)","journal-title":"IEEE Access"},{"issue":"4","key":"2549_CR60","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1023\/A:1008777829180","volume":"7","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid approximate extragradient\u2014proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Anal. 7(4), 323\u2013345 (1999)","journal-title":"Set-Valued Anal."},{"issue":"1","key":"2549_CR61","first-page":"59","volume":"6","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid projection-proximal point algorithm. J. Convex Anal. 6(1), 59\u201370 (1999)","journal-title":"J. Convex Anal."},{"issue":"1","key":"2549_CR62","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1287\/moor.27.1.150.342","volume":"27","author":"DF Sun","year":"2002","unstructured":"Sun, D.F., Sun, J.: Semismooth matrix-valued functions. Math. Oper. Res. 27(1), 150\u2013169 (2002)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2549_CR63","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1080\/10556788.2019.1576176","volume":"35","author":"DF Sun","year":"2020","unstructured":"Sun, D.F., Toh, K.-C., Yuan, Y., Zhao, X.-Y.: Sdpnal+: a Matlab software for semidefinite programming with bound constraints (version 1.0). Optim. Methods Softw. 35(1), 87\u2013115 (2020)","journal-title":"Optim. Methods Softw."},{"key":"2549_CR64","volume-title":"Optimal Transport: Old and New","author":"C Villani","year":"2008","unstructured":"Villani, C.: Optimal Transport: Old and New, vol. 338. Springer, Berlin (2008)"},{"issue":"3","key":"2549_CR65","doi-asserted-by":"crossref","first-page":"2294","DOI":"10.1137\/21M1441080","volume":"32","author":"YC Yuan","year":"2022","unstructured":"Yuan, Y.C., Chang, T.-H., Sun, D.F., Toh, K.-C.: A dimension reduction technique for large-scale structured sparse optimization problems with application to convex clustering. SIAM J. Optim. 32(3), 2294\u20132318 (2022)","journal-title":"SIAM J. Optim."},{"key":"2549_CR66","unstructured":"Yuan, Y.C., Lin, M.X., Sun, D.F., Toh, K.-C.: Adaptive sieving: a dimension reduction technique for sparse optimization problems. arXiv preprint arXiv:2306.17369 (2023)"},{"issue":"1","key":"2549_CR67","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10107-018-1329-6","volume":"179","author":"YJ Zhang","year":"2020","unstructured":"Zhang, Y.J., Zhang, N., Sun, D.F., Toh, K.-C.: An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems. Math. Program. 179(1), 223\u2013263 (2020)","journal-title":"Math. Program."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02549-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-024-02549-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-024-02549-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T14:17:26Z","timestamp":1716473846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-024-02549-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,4]]},"references-count":67,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2549"],"URL":"https:\/\/doi.org\/10.1007\/s10915-024-02549-7","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2024,5,4]]},"assertion":[{"value":"3 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2024","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 have no relevant financial or non-financial interests to disclose, and have no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"79"}}