{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:17Z","timestamp":1740122717929,"version":"3.37.3"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T00:00:00Z","timestamp":1689465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T00:00:00Z","timestamp":1689465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071280","11971220","12101262","12222106"],"award-info":[{"award-number":["12071280","11971220","12101262","12222106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2022A1515010263","2022B1515020082"],"award-info":[{"award-number":["2022A1515010263","2022B1515020082"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10589-023-00504-0","type":"journal-article","created":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T05:01:23Z","timestamp":1689483683000},"page":"669-710","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems"],"prefix":"10.1007","volume":"86","author":[{"given":"Gui-Hua","family":"Lin","sequence":"first","affiliation":[]},{"given":"Zhen-Ping","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Hai-An","family":"Yin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6691-5612","authenticated-orcid":false,"given":"Jin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,16]]},"reference":[{"key":"504_CR1","unstructured":"Allen-Zhu Z.: Natasha: Faster non-convex stochastic optimization via strongly non-convex parameter. In: International Conference on Machine Learning, vol. 70, pp. 89\u201397, PMLR Press (2017)"},{"issue":"3","key":"504_CR2","doi-asserted-by":"crossref","first-page":"2257","DOI":"10.1137\/18M1230323","volume":"29","author":"H Asi","year":"2019","unstructured":"Asi, H., Duchi, J.C.: Stochastic (approximate) proximal point methods: convergence, optimality, and adaptivity. SIAM. J. Optim. 29(3), 2257\u20132290 (2019)","journal-title":"SIAM. J. Optim."},{"key":"504_CR3","doi-asserted-by":"crossref","first-page":"22924","DOI":"10.1073\/pnas.1908018116","volume":"116","author":"H Asi","year":"2019","unstructured":"Asi, H., Duchi, J.C.: The importance of better models in stochastic optimization. Proc. Natl. Acad. Sci. USA 116, 22924\u201322930 (2019)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"1","key":"504_CR4","first-page":"1","volume":"18","author":"YF Atcha\u00e9","year":"2017","unstructured":"Atcha\u00e9, Y.F., Fort, G., Moulines, E.: On perturbed proximal gradient algorithms. J. Mach. Learn. Res. 18(1), 1\u201333 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"504_CR5","volume-title":"Convex Optimization Algorithms","author":"D Bertsekas","year":"2015","unstructured":"Bertsekas, D.: Convex Optimization Algorithms. Athena Scientific (2015)"},{"issue":"2","key":"504_CR6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"key":"504_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. SIAM, University City (1990)"},{"key":"504_CR8","doi-asserted-by":"crossref","unstructured":"Combettes P.L., Pesquet J.C.: Proximal splitting methods in signal processing. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, Springer-Verlag, New York, pp. 185\u2013212 (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"504_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29, 207\u2013239 (2019)","journal-title":"SIAM J. Optim."},{"key":"504_CR10","first-page":"1646","volume-title":"Advances in Neural Information Processing Systems","author":"A Defazio","year":"2014","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 27, pp. 1646\u20131654. Curran Associates, Inc. (2014)"},{"issue":"1","key":"504_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jae.2585","volume":"33","author":"M Demirer","year":"2018","unstructured":"Demirer, M., Diebold, F.X., Liu, L., Yilmaz, K.: Estimating global bank network connectedness. J. Appl. Econom. 33(1), 1\u201315 (2018)","journal-title":"J. Appl. Econom."},{"key":"504_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4939-1384-8","volume-title":"Handbook of Simulation Optimization. International Series in Operations Research and Management Science","author":"C Fu","year":"2015","unstructured":"Fu, C., Fu, C., Michael, M.: Handbook of Simulation Optimization. International Series in Operations Research and Management Science. Springer-Verlag, New York (2015)"},{"issue":"4","key":"504_CR13","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1137\/110848864","volume":"22","author":"S Ghadimi","year":"2012","unstructured":"Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: a generic algorithmic framework. SIAM J. Optim. 22(4), 1469\u20131492 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"504_CR14","doi-asserted-by":"crossref","first-page":"2061","DOI":"10.1137\/110848876","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization II: shrinking procedures and optimal algorithms. SIAM J. Optim. 23(4), 2061\u20132089 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"504_CR15","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10107-014-0846-1","volume":"155","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G., Zhang, H.: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization. Math. Program. 155(1\u20132), 267\u2013305 (2016)","journal-title":"Math. Program."},{"key":"504_CR16","first-page":"263","volume":"15","author":"R Goebel","year":"2008","unstructured":"Goebel, R., Rockafellar, R.T.: Local strong convexity and local Lipschitz continuity of the gradient of convex functions. J. Convex Anal. 15, 263\u2013270 (2008)","journal-title":"J. Convex Anal."},{"key":"504_CR17","unstructured":"Jalilzadeh A., Shanbhag U.V., Blanchet J.H., Glynn P.W.: Smoothed variable sample-size accelerated proximal methods for nonsmooth stochastic convex programs. https:\/\/arxiv.org\/pdf\/1803.00718.pdf (2020)"},{"issue":"1\u20132","key":"504_CR18","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10107-018-1297-x","volume":"174","author":"A Jofr\u00e9","year":"2019","unstructured":"Jofr\u00e9, A., Thompson, P.: On variance reduction for stochastic smooth convex optimization with multiplicative noise. Math. Program. 174(1\u20132), 253\u2013292 (2019)","journal-title":"Math. Program."},{"issue":"1","key":"504_CR19","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G Lan","year":"2012","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Math. Program. 133(1), 365\u2013397 (2012)","journal-title":"Math. Program."},{"key":"504_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-39568-1","volume-title":"First-order and Stochastic Optimization Methods for Machine Learning","author":"G Lan","year":"2020","unstructured":"Lan, G.: First-order and Stochastic Optimization Methods for Machine Learning. Springer-Verlag, New York (2020)"},{"key":"504_CR21","first-page":"1","volume":"0","author":"J Lei","year":"2020","unstructured":"Lei, J., Shanbhag, U.V.: Asynchronous variance-reduced block schemes for composite non-convex stochastic optimization: block-specific steplengths and adapted batch-sizes. Optim. Methods Softw. 0, 1\u201331 (2020)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"504_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"3","key":"504_CR23","doi-asserted-by":"crossref","first-page":"2026","DOI":"10.1137\/18M1207752","volume":"29","author":"M Lin","year":"2019","unstructured":"Lin, M., Liu, Y.J., Sun, D., Toh, K.C.: Efficient sparse semismooth Newton methods for the clustered lasso problem. SIAM J. Optim. 29(3), 2026\u20132052 (2019)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"504_CR24","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/16M1097572","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., 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."},{"key":"504_CR25","unstructured":"Lin M., Yuan Y., Sun D., Toh K.C.: Adaptive sieving with PPDNA: generating solution paths of exclusive lasso models, https:\/\/arxiv.org\/pdf\/2009.08719.pdf (2020)"},{"issue":"2","key":"504_CR26","doi-asserted-by":"crossref","first-page":"1842","DOI":"10.1137\/17M1136390","volume":"28","author":"X Li","year":"2018","unstructured":"Li, X., Sun, D., 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":"106","key":"504_CR27","first-page":"1","volume":"20","author":"Z Luo","year":"2019","unstructured":"Luo, Z., Sun, D., Toh, K.C., Xiu, N.: Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method. J. Mach. Learn. Res. 20(106), 1\u201325 (2019)","journal-title":"J. Mach. Learn. Res."},{"key":"504_CR28","unstructured":"McCann, M., Li, Y., Maguire, L., Johnston, A.: Causality challenge: benchmarking relevant signal components for effective monitoring and process control. In: Causality: Objectives and Assessment, pp 277\u2013288, PMLR (2010)"},{"issue":"4","key":"504_CR29","doi-asserted-by":"crossref","first-page":"2916","DOI":"10.1137\/18M1181249","volume":"29","author":"A Milzarek","year":"2019","unstructured":"Milzarek, A., Xiao, X., Cen, S., Wen, Z., Ulbrich, M.: A stochastic semismooth Newton method for nonsmooth nonconvex optimization. SIAM J. Optim. 29(4), 2916\u20132948 (2019)","journal-title":"SIAM J. Optim."},{"key":"504_CR30","doi-asserted-by":"crossref","first-page":"2151","DOI":"10.1007\/s11425-020-1865-1","volume":"65","author":"A Milzarek","year":"2022","unstructured":"Milzarek, A., Xiao, X., Wen, Z., Ulbrich, M.: On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization. Sci. China Math. 65, 2151\u20132170 (2022)","journal-title":"Sci. China Math."},{"key":"504_CR31","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0022-247X(79)90234-8","volume":"72","author":"GB Passty","year":"1979","unstructured":"Passty, G.B.: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space. J. Math. Anal. Appl. 72, 383\u2013390 (1979)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"504_CR32","first-page":"1","volume":"18","author":"A P\u0103tra\u015fcu","year":"2018","unstructured":"P\u0103tra\u015fcu, A., Necoara, I.: Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization. J. Mach. Learn. Res. 18(1), 1\u201342 (2018)","journal-title":"J. Mach. Learn. Res."},{"issue":"110","key":"504_CR33","first-page":"1","volume":"21","author":"NH Pham","year":"2020","unstructured":"Pham, N.H., Nguyen, L.M., Phan, D.T., Tran-Dinh, Q.: ProxSARAH: an efficient algorithmic framework for stochastic composite nonconvex optimization. J. Mach. Learn. Res. 21(110), 1\u201348 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"504_CR34","unstructured":"Reddi S.J., Sra S., P\u00f3czos B., Smola A.J.: Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization. In: Advance in Neural Information Processing Systems, vol. 29, pp. 1145\u20131153, MIT Press, Cambridge (2016)"},{"key":"504_CR35","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"504_CR36","doi-asserted-by":"crossref","unstructured":"Robbins H.,Siegund D.: A convergence theorem for non-negative almost supermartingales and some applications. In: Rustagi, J.S. (ed.), Optimizing Methods in Statistics (Proceedings of a Symposium at Ohio State University, Columbus, Ohio), Academic, pp. 233-257 (1971)","DOI":"10.1016\/B978-0-12-604550-5.50015-8"},{"key":"504_CR37","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1007\/s00245-019-09617-7","volume":"82","author":"L Rosasco","year":"2019","unstructured":"Rosasco, L., Villa, S., V\u0169, B.C.: Convergence of stochastic proximal gradient algorithm. Appl. Math. Optim. 82, 891\u2013917 (2019)","journal-title":"Appl. Math. Optim."},{"issue":"2","key":"504_CR38","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.1.2.97","volume":"1","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1(2), 97\u2013116 (1976)","journal-title":"Math. Oper. Res."},{"key":"504_CR39","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1997)"},{"issue":"5","key":"504_CR40","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"504_CR41","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.: Variational Analysis. Springer Science & Business Media (2009)"},{"key":"504_CR42","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, New York (2014)"},{"issue":"1\u20132","key":"504_CR43","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10107-014-0839-0","volume":"155","author":"S Shalev-Shwartz","year":"2016","unstructured":"Shalev-Shwartz, S., Zhang, T.: Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization. Math. Program. 155(1\u20132), 105\u2013145 (2016)","journal-title":"Math. Program."},{"key":"504_CR44","doi-asserted-by":"crossref","unstructured":"Shi Z., Liu R.: Large scale optimization with proximal stochastic Newton-type gradient descent. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pp. 691\u2013704, Springer, Cham (2015)","DOI":"10.1007\/978-3-319-23528-8_43"},{"issue":"226","key":"504_CR45","first-page":"1","volume":"21","author":"P Tang","year":"2020","unstructured":"Tang, P., Wang, C., Sun, D., 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."},{"key":"504_CR46","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the Lasso. J. Roy. Statist. Soc. Ser. B 58, 267\u2013288 (1996)","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"504_CR47","volume-title":"The Nature of Statistical Learning Theory","author":"V Vapnik","year":"2013","unstructured":"Vapnik, V.: The Nature of Statistical Learning Theory. Springer Science and Business Media, New York (2013)"},{"issue":"1","key":"504_CR48","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1137\/130931278","volume":"26","author":"MD Wang","year":"2016","unstructured":"Wang, M.D., Bertsekas, D.P.: Stochastic first-order methods with random constraint projection. SIAM J. Optim. 26(1), 681\u2013717 (2016)","journal-title":"SIAM J. Optim."},{"key":"504_CR49","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1080\/10556788.2018.1471141","volume":"34","author":"X Wang","year":"2019","unstructured":"Wang, X., Yuan, Y.X.: Stochastic proximal quasi-Newton methods for non-convex composite optimization. Optim. Methods Softw. 34, 922\u2013948 (2019)","journal-title":"Optim. Methods Softw."},{"issue":"42","key":"504_CR50","first-page":"1","volume":"20","author":"J Wang","year":"2019","unstructured":"Wang, J., Zhang, T.: Utilizing second order information in minibatch stochastic variance reduced proximal iterations. J. Mach. Learn. Res. 20(42), 1\u201356 (2019)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"504_CR51","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s10957-020-01799-3","volume":"188","author":"X Xiao","year":"2021","unstructured":"Xiao, X.: A unified convergence analysis of stochastic Bregman proximal gradient and extragradient methods. J. Optim. Theory Appl. 188(3), 605\u2013627 (2021)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"504_CR52","doi-asserted-by":"crossref","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., Zhang, T.: A proximal stochastic gradientmethod with progressive variance reduction. SIAM J. Optim. 24(4), 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"504_CR53","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10107-021-01629-y","volume":"194","author":"M Yang","year":"2022","unstructured":"Yang, M., Milzarek, A., Wen, Z., Zhang, T.: A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization. Math. Program. 194(1\u20132), 257\u2013303 (2022)","journal-title":"Math. Program."},{"issue":"4","key":"504_CR54","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/s11228-021-00591-3","volume":"29","author":"JJ Ye","year":"2021","unstructured":"Ye, J.J., Yuan, X., Zeng, S., Zhang, J.: Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems. Set-Valued Var. Anal. 29(4), 803\u2013837 (2021)","journal-title":"Set-Valued Var. Anal."},{"key":"504_CR55","doi-asserted-by":"crossref","unstructured":"Zhang N.: A dual based semismooth Newton method for a class of sparse Tikhonov regularization. arXiv:2006.08188 (2020)","DOI":"10.1016\/j.cam.2021.113641"},{"key":"504_CR56","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10107-018-1329-6","volume":"179","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Zhang, N., Sun, D., Toh, K.C.: An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems. Math. Program. 179, 223\u2013263 (2020)","journal-title":"Math. Program."},{"issue":"2","key":"504_CR57","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.L.: Regularization and variable selection via the elastic net. J. R. Stat. Soc.: Ser. B (Stat. Methodol.) 67(2), 301\u2013320 (2005)","journal-title":"J. R. Stat. Soc.: Ser. B (Stat. Methodol.)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00504-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00504-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00504-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T06:53:21Z","timestamp":1729752801000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00504-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,16]]},"references-count":57,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["504"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00504-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2023,7,16]]},"assertion":[{"value":"13 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2023","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 conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}