{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T09:50:54Z","timestamp":1780393854518,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"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":["12001072"],"award-info":[{"award-number":["12001072"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2019M653332"],"award-info":[{"award-number":["2019M653332"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012669","name":"Natural Science Foundation Project of Chongqing, Chongqing Science and Technology Commission","doi-asserted-by":"publisher","award":["cstc2019jcyj-zdxmX0016"],"award-info":[{"award-number":["cstc2019jcyj-zdxmX0016"]}],"id":[{"id":"10.13039\/501100012669","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012669","name":"Natural Science Foundation Project of Chongqing, Chongqing Science and Technology Commission","doi-asserted-by":"publisher","award":["12271067"],"award-info":[{"award-number":["12271067"]}],"id":[{"id":"10.13039\/501100012669","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Major Program of the National Natural Science Foundation of China","award":["11991020"],"award-info":[{"award-number":["11991020"]}]},{"name":"the Major Program of the National Natural Science Foundation of China","award":["11991024"],"award-info":[{"award-number":["11991024"]}]},{"name":"the NSFC-RGC (Hong Kong) Joint Research Program","award":["12261160365"],"award-info":[{"award-number":["12261160365"]}]},{"name":"Chongqing Natural Science Foundation Project","award":["CSTB2022NSCQ-MSX1318"],"award-info":[{"award-number":["CSTB2022NSCQ-MSX1318"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10957-023-02334-w","type":"journal-article","created":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T12:02:20Z","timestamp":1700049740000},"page":"215-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Adaptive Sampling Stochastic Multigradient Algorithm for Stochastic Multiobjective Optimization"],"prefix":"10.1007","volume":"200","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9688-2276","authenticated-orcid":false,"given":"Yong","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinmin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,11,15]]},"reference":[{"issue":"11","key":"2334_CR1","doi-asserted-by":"publisher","first-page":"2289","DOI":"10.1080\/02331934.2014.947500","volume":"64","author":"MA Ansary","year":"2015","unstructured":"Ansary, M.A., Panda, G.: A modified quasi-Newton method for vector optimization problem. Optimization 64(11), 2289\u20132306 (2015)","journal-title":"Optimization"},{"key":"2334_CR2","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drac083","author":"F Beiser","year":"2023","unstructured":"Beiser, F., Keith, B., Urbainczyk, S., Wohlmuth, B.: Adaptive sampling strategies for risk-averse stochastic optimization with constraints. IMA J. Numer. Anal. (2023). https:\/\/doi.org\/10.1093\/imanum\/drac083","journal-title":"IMA J. Numer. Anal."},{"issue":"4","key":"2334_CR3","doi-asserted-by":"publisher","first-page":"3312","DOI":"10.1137\/17M1154679","volume":"28","author":"R Bollapragada","year":"2018","unstructured":"Bollapragada, R., Byrd, R.H., Nocedal, J.: Adaptive sampling strategies for stochastic optimization. SIAM J. Optim. 28(4), 3312\u20133343 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2334_CR4","doi-asserted-by":"publisher","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."},{"issue":"1","key":"2334_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-012-0572-5","volume":"134","author":"RH Byrd","year":"2012","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Wu, Y.: Sample size selection in optimization methods for machine learning. Math. Program. 134(1), 127\u2013155 (2012)","journal-title":"Math. Program."},{"issue":"2","key":"2334_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-017-1137-4","volume":"169","author":"C Cartis","year":"2018","unstructured":"Cartis, C., Scheinberg, K.: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 169(2), 337\u2013375 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"2334_CR7","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1109\/COMST.2017.2698366","volume":"19","author":"JH Cho","year":"2017","unstructured":"Cho, J.H., Wang, Y.T., Chen, R., Chan, K.S., Swami, A.: A survey on modeling and optimizing multi-objective systems. IEEE Commun. Surv. Tutor. 19(3), 1867\u20131901 (2017)","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"5","key":"2334_CR8","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MSP.2020.3003539","volume":"37","author":"FE Curtis","year":"2020","unstructured":"Curtis, F.E., Scheinberg, K.: Adaptive stochastic optimization: a framework for analyzing stochastic optimization algorithms. IEEE Signal Proc. Mag. 37(5), 32\u201342 (2020)","journal-title":"IEEE Signal Proc. Mag."},{"key":"2334_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511779398","volume-title":"Probability: Theory and Examples","author":"R Durrett","year":"2010","unstructured":"Durrett, R.: Probability: Theory and Examples. Cambridge University Press, London (2010)"},{"key":"2334_CR10","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005)"},{"issue":"2","key":"2334_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10898-021-01109-9","volume":"83","author":"G Eichfelder","year":"2022","unstructured":"Eichfelder, G., Warnow, L.: An approximation algorithm for multi-objective optimization problems using a box-coverage. J. Global Optim. 83(2), 329\u2013357 (2022)","journal-title":"J. Global Optim."},{"issue":"3","key":"2334_CR12","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s001860000043","volume":"51","author":"J Fliege","year":"2000","unstructured":"Fliege, J., Svaiter, B.F.: Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res. 51(3), 479\u2013494 (2000)","journal-title":"Math. Methods Oper. Res."},{"issue":"5","key":"2334_CR13","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1080\/10556788.2018.1510928","volume":"34","author":"J Fliege","year":"2019","unstructured":"Fliege, J., Vaz, A.I.F., Vicente, L.N.: Complexity of gradient descent for multiobjective optimization. Optim. Methods Softw. 34(5), 949\u2013959 (2019)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"2334_CR14","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2013.10.028","volume":"234","author":"J Fliege","year":"2014","unstructured":"Fliege, J., Werner, R.: Robust multiobjective optimization & applications in portfolio optimization. Eur. J. Oper. Res. 234(2), 422\u2013433 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2334_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10957-011-9859-6","volume":"151","author":"J Fliege","year":"2011","unstructured":"Fliege, J., Xu, H.F.: Stochastic multiobjective optimization: sample average approximation and applications. J. Optim. Theory Appl. 151(1), 135\u2013162 (2011)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2334_CR16","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1590\/0101-7438.2014.034.03.0585","volume":"34","author":"EH Fukuda","year":"2014","unstructured":"Fukuda, E.H., Gra\u00f1a Drummond, L.M.: A survey on multiobjective descent methods. Pesqui. Oper. 34(3), 585\u2013620 (2014)","journal-title":"Pesqui. Oper."},{"key":"2334_CR17","unstructured":"Garrigos, G.: Square distance functions are Polyak\u2013\u0141ojasiewicz and vice-versa. arXiv:2301.10332 (2023)"},{"issue":"1","key":"2334_CR18","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1007\/s10107-022-01809-4","volume":"198","author":"G Garrigos","year":"2023","unstructured":"Garrigos, G., Rosasco, L., Villa, S.: Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry. Math. Program. 198(1), 937\u2013996 (2023)","journal-title":"Math. Program."},{"issue":"2","key":"2334_CR19","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10589-022-00414-7","volume":"83","author":"MLN Goncalves","year":"2022","unstructured":"Goncalves, M.L.N., Lima, F.S., Prudente, L.F.: Globally convergent Newton-type methods for multiobjective optimization. Comput. Optim. Appl. 83(2), 403\u2013434 (2022)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"2334_CR20","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10479-013-1369-5","volume":"236","author":"WJ Gutjahr","year":"2016","unstructured":"Gutjahr, W.J., Pichler, A.: Stochastic multi-objective optimization: a survey on non-scalarizing methods. Ann. Oper. Res. 236(2), 475\u2013499 (2016)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"2334_CR21","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1109\/TNSE.2022.3169117","volume":"9","author":"Z Hu","year":"2022","unstructured":"Hu, Z., Shaloudegi, K., Zhang, G.J., Yu, Y.L.: Federated learning meets multi-objective optimization. IEEE Trans. Netw. Sci. Eng. 9(4), 2039\u20132051 (2022)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"1","key":"2334_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3299872","volume":"29","author":"SR Hunter","year":"2019","unstructured":"Hunter, S.R., Applegate, E.A., Arora, V., Chong, B., Cooper, K., Guevara, O.R., Valencia, C.V.: An introduction to multiobjective simulation optimization. ACM Trans. Model. Comput. Simul. 29(1), 1\u201336 (2019)","journal-title":"ACM Trans. Model. Comput. Simul."},{"issue":"3","key":"2334_CR23","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TSMCC.2008.919172","volume":"38","author":"YC Jin","year":"2008","unstructured":"Jin, Y.C., Sendhoff, B.: Pareto-based multiobjective machine learning: an overview and case studies. IEEE Trans. Syst. Man Cybern. Part C 38(3), 397\u2013415 (2008)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C"},{"key":"2334_CR24","doi-asserted-by":"crossref","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak-\u0141ojasiewicz condition. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.), Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2016, Proceedings. Springer International Publishing, Part I 16, pp. 795\u2013811 (2016)","DOI":"10.1007\/978-3-319-46128-1_50"},{"issue":"3","key":"2334_CR25","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.ejor.2012.11.005","volume":"226","author":"GH Lin","year":"2013","unstructured":"Lin, G.H., Zhang, D.L., Liang, Y.C.: Stochastic multiobjective problems with complementarity constraints and applications in healthcare management. Eur. J. Oper. Res. 226(3), 461\u2013470 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"2334_CR26","unstructured":"Lin, X., Zhen, H.L., Li, Z.H., Zhang, Q.F., Kwong, S.: Pareto multi-task learning. In: Wallach, H., Larochelle, H., Beygelzimer, A., d$$^{\\prime }$$Alch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 32, pp. 12037\u201312047 (2019)"},{"key":"2334_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-021-04033-z","author":"S Liu","year":"2021","unstructured":"Liu, S., Vicente, L.N.: The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learning. Ann. Oper. Res. (2021). https:\/\/doi.org\/10.1007\/s10479-021-04033-z","journal-title":"Ann. Oper. Res."},{"key":"2334_CR28","unstructured":"Mahdavi, M., Yang, T.B., Jin, R.: Stochastic convex optimization with multiple objectives. In: Burges, C.J., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 32, pp. 1115\u20131123 (2013)"},{"issue":"3","key":"2334_CR29","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1016\/j.ejor.2018.05.064","volume":"271","author":"Q Mercier","year":"2018","unstructured":"Mercier, Q., Poirion, F., D\u00e9sid\u00e9ri, J.A.: A stochastic multiple gradient descent algorithm. Eur. J. Oper. Res. 271(3), 808\u2013817 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2334_CR30","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1137\/140951679","volume":"28","author":"R Pasupathy","year":"2018","unstructured":"Pasupathy, R., Glynn, P., Ghosh, S., Hashemi, F.S.: On sampling rates in simulation-based recursions. SIAM J. Optim. 28(1), 45\u201373 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2334_CR31","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10589-017-9921-x","volume":"68","author":"F Poirion","year":"2017","unstructured":"Poirion, F., Mercier, Q., D\u00e9sid\u00e9ri, J.A.: Descent algorithm for nonsmooth stochastic multiobjective optimization. Comput. Optim. Appl. 68(2), 317\u2013331 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"2334_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105676","volume":"141","author":"M Reiners","year":"2022","unstructured":"Reiners, M., Klamroth, K., Heldmann, F., Stiglmayr, M.: Efficient and sparse neural networks by pruning weights in a multiobjective learning approach. Comput. Oper. Res. 141(5), 105676 (2022)","journal-title":"Comput. Oper. Res."},{"key":"2334_CR33","unstructured":"Sener, O., Koltun, V.: Multi-task learning as multi-objective optimization. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 31, pp. 527\u2013538 (2018)"},{"issue":"2","key":"2334_CR34","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s11590-022-01877-7","volume":"17","author":"H Tanabe","year":"2023","unstructured":"Tanabe, H., Fukuda, E.H., Yamashita, N.: Convergence rates analysis of a multiobjective proximal gradient method. Optim. Lett. 17(2), 333\u2013350 (2023)","journal-title":"Optim. Lett."},{"key":"2334_CR35","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1007\/978-1-4939-3094-4_18","volume-title":"Multiple Criteria Decision Analysis: State of the art surveys","author":"MM Wiecek","year":"2016","unstructured":"Wiecek, M.M., Ehrgott, M., Engau, A.: Continuous multiobjective programming. In: Greco, S., Ehrgott, M., Figueira, J.R. (eds.) Multiple Criteria Decision Analysis: State of the art surveys, pp. 739\u2013815. Springer, New York (2016)"},{"issue":"6","key":"2334_CR36","first-page":"681","volume":"17","author":"Y Zhao","year":"2021","unstructured":"Zhao, Y., Chen, L., Yang, X.M.: A sample average approximation method based on a gap function for stochastic multiobjective optimization problems. Pac. J. Optim. 17(6), 681\u2013694 (2021)","journal-title":"Pac. J. Optim."},{"key":"2334_CR37","unstructured":"Zhou, S.J., Zhang, W.P., Jiang, J.Y., Zhong, W.L., Gu, J.J., Zhu, W.W.: On the convergence of stochastic multi-objective gradient manipulation and beyond. In: Koyejo, S., Mohamed, S., Agarwal, A., Belgrave, D., Cho, K., Oh, A. (eds.) Advances in Neural Information Processing Systems, vol. 35, pp. 38103\u201338115 (2022)"},{"issue":"4","key":"2334_CR38","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02334-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-023-02334-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-023-02334-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,21]],"date-time":"2024-01-21T08:02:37Z","timestamp":1705824157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-023-02334-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["2334"],"URL":"https:\/\/doi.org\/10.1007\/s10957-023-02334-w","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"21 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}