{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:38:57Z","timestamp":1740145137039,"version":"3.37.3"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T00:00:00Z","timestamp":1663718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"eu","award":["OP VVV project CZ.02.1.01\/0.0\/0.0\/16 019\/0000765 Research Center for Informatics"],"award-info":[{"award-number":["OP VVV project CZ.02.1.01\/0.0\/0.0\/16 019\/0000765 Research Center for Informatics"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s11590-022-01931-4","type":"journal-article","created":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T11:04:03Z","timestamp":1663758243000},"page":"1215-1228","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Regularized quasi-monotone method for stochastic optimization"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2229-8824","authenticated-orcid":false,"given":"V.","family":"Kungurtsev","sequence":"first","affiliation":[]},{"given":"V.","family":"Shikhman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"issue":"7","key":"1931_CR1","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1007\/s11590-017-1195-9","volume":"12","author":"J Bai","year":"2018","unstructured":"Bai, J., Zhang, H., Li, J.: A parameterized proximal point algorithm for separable convex optimization. Optim. Lett. 12(7), 1589\u20131608 (2018)","journal-title":"Optim. Lett."},{"issue":"1","key":"1931_CR2","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/s10957-018-01454-y","volume":"182","author":"S Bitterlich","year":"2019","unstructured":"Bitterlich, S., Bo\u0163, R.I., Csetnek, E.R., Wanka, G.: The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints. J. Optim. Theory Appl. 182(1), 110\u2013132 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1931_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J., et al.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"1931_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.automatica.2018.11.056","volume":"101","author":"S Liang","year":"2019","unstructured":"Liang, S., Wang, L., Yin, G.: Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs. Automatica 101, 175\u2013181 (2019)","journal-title":"Automatica"},{"issue":"3","key":"1931_CR5","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s10957-014-0677-5","volume":"165","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y., Shikhman, V.: Quasi-monotone subgradient methods for nonsmooth convex minimization. J. Optim. Theory Appl. 165(3), 917\u2013940 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"1931_CR6","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1109\/TCYB.2018.2874332","volume":"50","author":"W Tao","year":"2020","unstructured":"Tao, W., Pan, Z., Wu, G., Tao, Q.: Primal averaging: a new gradient evaluation step to attain the optimal individual convergence. IEEE Trans. Cybern. 50, 835\u2013845 (2020)","journal-title":"IEEE Trans. Cybern."},{"key":"1931_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TNNLS.2020.2994834","volume":"31","author":"W Tao","year":"2020","unstructured":"Tao, W., Pan, Z., Wu, G., Tao, Q.: Strength of Nesterov\u2019s extrapolation in the individual convergence of nonsmooth optimization. IEEE Trans. Neural Netw. Learn. Syst. 31, 1\u201312 (2020)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"88","key":"1931_CR8","first-page":"2543","volume":"11","author":"L Xiao","year":"2010","unstructured":"Xiao, L.: Dual averaging methods for regularized stochastic learning and online optimization. J. Mach. Learn. Res. 11(88), 2543\u20132596 (2010)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01931-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01931-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01931-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T10:34:01Z","timestamp":1683542041000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01931-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,21]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1931"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01931-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,9,21]]},"assertion":[{"value":"8 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}