{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T18:39:52Z","timestamp":1775155192616,"version":"3.50.1"},"reference-count":127,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T00:00:00Z","timestamp":1615593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T00:00:00Z","timestamp":1615593600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11831002"],"award-info":[{"award-number":["11831002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Fund - SRIBD Startup Fund","award":["JCYJ-AM20190601"],"award-info":[{"award-number":["JCYJ-AM20190601"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11421101"],"award-info":[{"award-number":["11421101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10107-021-01629-y","type":"journal-article","created":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T15:02:46Z","timestamp":1615647766000},"page":"257-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization"],"prefix":"10.1007","volume":"194","author":[{"given":"Minghan","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6784-5417","authenticated-orcid":false,"given":"Andre","family":"Milzarek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zaiwen","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,13]]},"reference":[{"issue":"116","key":"1629_CR1","first-page":"1","volume":"18","author":"N Agarwal","year":"2017","unstructured":"Agarwal, N., Bullins, B., Hazan, E.: Second-order stochastic optimization for machine learning in linear time. J. Mach. Learn. Res. 18(116), 1\u201340 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"1629_CR2","unstructured":"Akiba, T., Suzuki, S., Fukuda, K.: Extremely large minibatch SGD: training Resnet-50 on ImageNet in 15 minutes (2017). http:\/\/arxiv.org\/abs\/1711.04325"},{"key":"1629_CR3","doi-asserted-by":"crossref","unstructured":"Allen-Zhu, Z.: Katyusha: The first direct acceleration of stochastic gradient methods. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 1200\u20131205 (2017)","DOI":"10.1145\/3055399.3055448"},{"key":"1629_CR4","unstructured":"Allen-Zhu, Z., Hazan, E.: Variance reduction for faster non-convex optimization. In: Proceedings of the 33rd International Conference on Machine Learning, 699\u2013707 (2016)"},{"key":"1629_CR5","doi-asserted-by":"crossref","unstructured":"Andrew, G., Gao, J.: Scalable training of $$\\ell _1$$-regularized log-linear models. In: Proceedings of the 24th International Conference on Machine Learning, 33\u201340 (2007)","DOI":"10.1145\/1273496.1273501"},{"issue":"1","key":"1629_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000015","volume":"4","author":"F Bach","year":"2011","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G.: Optimization with sparsity-inducing penalties. Found. Trends Mach. Learn. 4(1), 1\u2013106 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"1629_CR7","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces. CMS books in mathematics\/Ouvrages de Math\u00e9matiques de la SMC","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert spaces. CMS books in mathematics\/Ouvrages de Math\u00e9matiques de la SMC. Springer, New York (2011)"},{"issue":"4","key":"1629_CR8","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1080\/10556788.2020.1725751","volume":"35","author":"AS Berahas","year":"2020","unstructured":"Berahas, A.S., Bollapragada, R., Nocedal, J.: An investigation of Newton-sketch and subsampled Newton methods. Optim. Methods Softw. 35(4), 661\u2013680 (2020). https:\/\/doi.org\/10.1080\/10556788.2020.1725751","journal-title":"Optim. Methods Softw."},{"key":"1629_CR9","unstructured":"Berahas, A.S., Nocedal, J., Tak\u00e1c, M.: A multi-batch L-BFGS method for machine learning. In: Advances in Neural Information Processing Systems, pp. 1063\u20131071 (2016)"},{"key":"1629_CR10","volume-title":"Pattern recognition and machine learning. information science and statistics.","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern recognition and machine learning. information science and statistics. Springer, New York (2006)"},{"key":"1629_CR11","first-page":"1","volume":"39","author":"R Bollapragada","year":"2018","unstructured":"Bollapragada, R., Byrd, R., Nocedal, J.: Exact and inexact subsampled Newton methods for optimization. IMA J. Numer. Anal. 39, 1\u201334 (2018)","journal-title":"IMA J. Numer. Anal."},{"key":"1629_CR12","unstructured":"Botev, A., Ritter, H., Barber, D.: Practical Gauss-Newton optimization for deep learning. In: Proceedings of the 34th International Conference on Machine Learning, 557\u2013565 (2017)"},{"issue":"2","key":"1629_CR13","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."},{"issue":"3","key":"1629_CR14","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1137\/10079923X","volume":"21","author":"RH Byrd","year":"2011","unstructured":"Byrd, R.H., Chin, G.M., Neveitt, W., Nocedal, J.: On the use of stochastic Hessian information in optimization methods for machine learning. SIAM J. Optim. 21(3), 977\u2013995 (2011)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1629_CR15","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1137\/140954362","volume":"26","author":"RH Byrd","year":"2016","unstructured":"Byrd, R.H., Hansen, S.L., Nocedal, J., Singer, Y.: A stochastic quasi-Newton method for large-scale optimization. SIAM J. Optim. 26(2), 1008\u20131031 (2016)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"1629_CR16","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"2","key":"1629_CR17","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/s10957-010-9757-3","volume":"148","author":"Y Censor","year":"2011","unstructured":"Censor, Y., Gibali, A., Reich, S.: The subgradient extragradient method for solving variational inequalities in hilbert space. J. Optim. Theor. Appl. 148(2), 318\u2013335 (2011)","journal-title":"J. Optim. Theor. Appl."},{"key":"1629_CR18","doi-asserted-by":"crossref","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P.A., Willsky, A.S.: Sparse and low-rank matrix decompositions. In: 27th Annual Allerton Conference on Communication, Control and Computing, 42: 1493\u20131498 (2009)","DOI":"10.3182\/20090706-3-FR-2004.00249"},{"issue":"3","key":"1629_CR19","doi-asserted-by":"crossref","first-page":"27","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), 27 (2011)","journal-title":"ACM. Trans. Intell. Syst. Technol."},{"issue":"2","key":"1629_CR20","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01300972","volume":"3","author":"X Chen","year":"1994","unstructured":"Chen, X., Qi, L.: A parameterized Newton method and a quasi-Newton method for nonsmooth equations. Comput. Optim. Appl. 3(2), 157\u2013179 (1994)","journal-title":"Comput. Optim. Appl."},{"key":"1629_CR21","volume-title":"Proximal splitting methods in signal processing. in: fixed-point algorithms for inverse problems in science and engineering","author":"PL Combettes","year":"2011","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, New York (2011)"},{"issue":"4","key":"1629_CR22","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"1629_CR23","volume-title":"Trust-region methods. MPS\/SIAM series on optimization. SIAM","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-region methods. MPS\/SIAM series on optimization. SIAM. MPS, Philadelphia (2000)"},{"key":"1629_CR24","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic subgradient method converges at the rate O$$(k^{-1\/4})$$ on weakly convex functions (2018). http:\/\/arxiv.org\/abs\/1802.02988"},{"issue":"1","key":"1629_CR25","doi-asserted-by":"publisher","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(1), 207\u2013239 (2019). https:\/\/doi.org\/10.1137\/18M1178244","journal-title":"SIAM J. Optim."},{"key":"1629_CR26","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives. In: Proceedings of the 27th International Conference on Neural Information Processing Systems, pp. 1646\u20131654 (2014)"},{"key":"1629_CR27","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1561\/2000000039","volume":"7","author":"L Deng","year":"2014","unstructured":"Deng, L., Yu, D.: Deep learning: methods and applications. Found. Trends Signal Process. 7, 197\u2013387 (2014)","journal-title":"Found. Trends Signal Process."},{"issue":"9","key":"1629_CR28","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1016\/j.aml.2007.07.037","volume":"22","author":"Y Dong","year":"2009","unstructured":"Dong, Y.: An extension of Luque\u2019s growth condition. Appl. Math. Lett. 22(9), 1390\u20131393 (2009)","journal-title":"Appl. Math. Lett."},{"issue":"3","key":"1629_CR29","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Oper. Res. 43(3), 919\u2013948 (2018)","journal-title":"Math. Oper. Res."},{"key":"1629_CR30","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1629_CR31","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":"1629_CR32","unstructured":"Erdogdu, M.A., Montanari, A.: Convergence rates of sub-sampled Newton methods. In: Advances in Neural Information Processing Systems, pp. 28 (2015)"},{"key":"1629_CR33","first-page":"1871","volume":"9","author":"RE Fan","year":"2008","unstructured":"Fan, R.E., Chang, K.W., Hsieh, C.J., Wang, X.R., Lin, C.J.: LIBLINEAR: A library for large linear classification. J. Mach. Learn. Res. 9, 1871\u20131874 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"1629_CR34","unstructured":"Fang, C., Li, C.J., Lin, Z., Zhang, T.: SPIDER: Near-optimal non-convex optimization via stochastic path-integrated differential estimator. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, pp. 687\u2013697 (2018)"},{"issue":"4","key":"1629_CR35","doi-asserted-by":"crossref","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1629_CR36","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156(1\u20132), 59\u201399 (2016)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1629_CR37","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":"1629_CR38","unstructured":"Gower, R., Goldfarb, D., Richt\u00e1rik, P.: Stochastic block BFGS: Squeezing more curvature out of data. In: Proceedings of the 33rd International Conference on Machine Learning, 1869\u20131878 (2016)"},{"key":"1629_CR39","unstructured":"Goyal, P., Doll\u00e1r, P., Girshick, R., Noordhuis, P., Wesolowski, L., Kyrola, A., Tulloch, A., Jia, Y., He, K.: Accurate, large minibatch SGD: Training ImageNet in 1 hour (2017). http:\/\/arxiv.org\/abs\/1706.02677"},{"key":"1629_CR40","unstructured":"Grosse, R., Martens, J.: A Kronecker-factored approximate Fisher matrix for convolution layers. In: Proceedings of the 33rd International Conference on Machine Learning, 573\u2013582 (2016)"},{"key":"1629_CR41","volume-title":"Data mining, inference, and prediction. the elements of statistical learning Springer series in statistics","author":"T Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: Data mining, inference, and prediction. the elements of statistical learning Springer series in statistics. Springer-Verlag, New York (2001)"},{"key":"1629_CR42","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"issue":"1","key":"1629_CR43","first-page":"2911","volume":"15","author":"CJ Hsieh","year":"2014","unstructured":"Hsieh, C.J., Sustik, M.A., Dhillon, I.S., Ravikumar, P.: QUIC: quadratic approximation for sparse inverse covariance estimation. J. Mach. Learn. Res. 15(1), 2911\u20132947 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"1629_CR44","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1137\/15M1031953","volume":"27","author":"AN Iusem","year":"2017","unstructured":"Iusem, A.N., Jofr\u00e9, A., Oliveira, R.I., Thompson, P.: Extragradient method with variance reduction for stochastic variational inequalities. SIAM J. Optim. 27(2), 686\u2013724 (2017)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1629_CR45","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s12532-016-0101-2","volume":"8","author":"D Janka","year":"2016","unstructured":"Janka, D., Kirches, C., Sager, S., W\u00e4chter, A.: An SR1\/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix. Math. Program. Comput. 8(4), 435\u2013459 (2016)","journal-title":"Math. Program. Comput."},{"key":"1629_CR46","first-page":"315","volume":"26","author":"R Johnson","year":"2013","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. Adv. in Neural Inf. Process. Syst. 26, 315\u2013323 (2013)","journal-title":"Adv. in Neural Inf. Process. Syst."},{"key":"1629_CR47","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. http:\/\/arxiv.org\/abs\/1412.6980 (2014)"},{"key":"1629_CR48","unstructured":"Kohler, J.M., Lucchi, A.: Sub-sampled cubic regularization for non-convex optimization. In: Proceedings of the 34th International Conference on Machine Learning, 70:. 1895\u20131904 (2017)"},{"issue":"2","key":"1629_CR49","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/JSTSP.2015.2505682","volume":"10","author":"J Kone\u010dn\u1ef3","year":"2016","unstructured":"Kone\u010dn\u1ef3, J., Liu, J., Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Mini-batch semi-stochastic gradient descent in the proximal setting. IEEE J. Sel. Topics in Signal Process. 10(2), 242\u2013255 (2016)","journal-title":"IEEE J. Sel. Topics in Signal Process."},{"key":"1629_CR50","first-page":"747","volume":"12","author":"G Korpelevich","year":"1976","unstructured":"Korpelevich, G.: The extragradient method for finding saddle points and other problems. Matecon 12, 747\u2013756 (1976)","journal-title":"Matecon"},{"issue":"7553","key":"1629_CR51","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436 (2015)","journal-title":"Nature"},{"issue":"3","key":"1629_CR52","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1137\/130921428","volume":"24","author":"JD Lee","year":"2014","unstructured":"Lee, J.D., Sun, Y., Saunders, M.A.: Proximal Newton-type methods for minimizing composite functions. SIAM J. Optim. 24(3), 1420\u20131443 (2014)","journal-title":"SIAM J. Optim."},{"key":"1629_CR53","unstructured":"Lei, L., Ju, C., Chen, J., Jordan, M.I.: Non-convex finite-sum optimization via SCSG methods. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 2345\u20132355 (2017)"},{"key":"1629_CR54","unstructured":"Lin, H., Mairal, J., Harchaoui, Z.: A universal catalyst for first-order optimization. In: Advances in Neural Information Processing Systems, pp. 3384\u20133392 (2015)"},{"issue":"1","key":"1629_CR55","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10208-015-9282-8","volume":"17","author":"T Lin","year":"2017","unstructured":"Lin, T., Ma, S., Zhang, S.: An extragradient-based alternating direction method for convex minimization. Found. Comput. Math. 17(1), 35\u201359 (2017)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"1629_CR56","first-page":"503","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45(3), 503\u2013528 (1989)","journal-title":"Math. Program."},{"key":"1629_CR57","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s10107-018-1285-1","volume":"178","author":"H Liu","year":"2018","unstructured":"Liu, H., So, A.M.C., Wu, W.: Quadratic optimization with orthogonality constraint: explicit \u0141ojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods. Math. Program. 178, 215\u2013262 (2018)","journal-title":"Math. Program."},{"key":"1629_CR58","unstructured":"Liu, X., Hsieh, C.J.: Fast variance reduction method with stochastic batch size. In: Proceedings of the 35th International Conference on Machine Learning, 3185\u20133194 (2018)"},{"issue":"1\u20134","key":"1629_CR59","first-page":"157","volume":"46","author":"ZQ Luo","year":"1993","unstructured":"Luo, Z.Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46(1\u20134), 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"key":"1629_CR60","unstructured":"LIBLINEAR: A library for large linear classification. http:\/\/www.csie.ntu.edu.tw\/~cjlin\/liblinear"},{"key":"1629_CR61","doi-asserted-by":"crossref","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online dictionary learning for sparse coding. In: Proceedings of the 26th International Conference on Machine Learning, 689\u2013696 (2009)","DOI":"10.1145\/1553374.1553463"},{"key":"1629_CR62","unstructured":"Mannel, F., Rund, A.: A hybrid semismooth quasi-Newton method for structured nonsmooth operator equations in Banach spaces (2018). https:\/\/imsc.uni-graz.at\/mannel\/sqn1.pdf"},{"key":"1629_CR63","unstructured":"Martens, J.: Deep learning via Hessian-free optimization. In: Proceedings of the 27th International Conference on Machine Learning, 27: 735\u2013742 (2010)"},{"key":"1629_CR64","unstructured":"Martens, J., Grosse, R.: Optimizing neural networks with Kronecker-factored approximate curvature. In: Proceedings of the 32nd International Conference on Machine Learning, pp. 2408\u20132417 (2015)"},{"key":"1629_CR65","unstructured":"Mason, L., Baxter, J., Bartlett, P., Frean, M.: Boosting algorithms as gradient descent in function space. In: Proceedings of the 12th International Conference on Neural Information Processing Systems, pp. 512\u2013518 (1999)"},{"issue":"4","key":"1629_CR66","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."},{"issue":"2","key":"1629_CR67","doi-asserted-by":"crossref","first-page":"1670","DOI":"10.1137\/17M1122943","volume":"28","author":"A Mokhtari","year":"2018","unstructured":"Mokhtari, A., Eisen, M., Ribeiro, A.: IQN: An incremental quasi-Newton method with local superlinear convergence rate. SIAM J. Optim. 28(2), 1670\u20131698 (2018)","journal-title":"SIAM J. Optim."},{"issue":"23","key":"1629_CR68","doi-asserted-by":"crossref","first-page":"6089","DOI":"10.1109\/TSP.2014.2357775","volume":"62","author":"A Mokhtari","year":"2014","unstructured":"Mokhtari, A., Ribeiro, A.: RES: regularized stochastic BFGS algorithm. IEEE Trans. Signal Process. 62(23), 6089\u20136104 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"1629_CR69","first-page":"3151","volume":"16","author":"A Mokhtari","year":"2015","unstructured":"Mokhtari, A., Ribeiro, A.: Global convergence of online limited memory BFGS. J. Mach. Learn. Res. 16, 3151\u20133181 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"4","key":"1629_CR70","doi-asserted-by":"crossref","first-page":"1688","DOI":"10.1137\/100801652","volume":"21","author":"RD Monteiro","year":"2011","unstructured":"Monteiro, R.D., Svaiter, B.F.: Complexity of variants of tseng\u2019s modified fb splitting and korpelevich\u2019s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems. SIAM J. Optim. 21(4), 1688\u20131720 (2011)","journal-title":"SIAM J. Optim."},{"key":"1629_CR71","doi-asserted-by":"crossref","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"JJ Moreau","year":"1965","unstructured":"Moreau, J.J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull. Soc. Math. FR. 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. FR."},{"key":"1629_CR72","unstructured":"Moritz, P., Nishihara, R., Jordan, M.: A linearly-convergent stochastic L-BFGS algorithm. In: Proceedings of the 19th Conference on Artificial Intelligence and Statistics, pp. 249\u2013258 (2016)"},{"key":"1629_CR73","unstructured":"Mutn\u00fd, M.: Stochastic second-order optimization via Neumann series (2016). http:\/\/arxiv.org\/abs\/1612.04694"},{"issue":"1","key":"1629_CR74","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":"1629_CR75","unstructured":"Nguyen, L.M., van Dijk, M., Phan, D.T., Nguyen, P.H., Weng, T.W., Kalagnanam, J.R.: Finite-sum smooth optimization with SARAH (2019). http:\/\/arxiv.org\/abs\/1901.07648v2"},{"key":"1629_CR76","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Tak\u00e1\u010d, M.: SARAH: A novel method for machine learning problems using stochastic recursive gradient. In: Proceedings of the 34th International Conference on Machine Learning, 2613\u20132621 (2017)"},{"issue":"1","key":"1629_CR77","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s10957-017-1200-6","volume":"176","author":"TP Nguyen","year":"2018","unstructured":"Nguyen, T.P., Pauwels, E., Richard, E., Suter, B.W.: Extragradient method in optimization: convergence and complexity. J. Optim. Theory Appl. 176(1), 137\u2013162 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"151","key":"1629_CR78","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comp. 35(151), 773\u2013782 (1980)","journal-title":"Math. Comp."},{"key":"1629_CR79","doi-asserted-by":"crossref","unstructured":"Osawa, K., Tsuji, Y., Ueno, Y., Naruse, A., Yokota, R., Matsuoka, S.: Large-scale distributed second-order optimization using Kronecker-factored approximate curvature for deep convolutional neural networks (2018). http:\/\/arxiv.org\/abs\/1811.12019","DOI":"10.1109\/CVPR.2019.01264"},{"issue":"3","key":"1629_CR80","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/0803021","volume":"3","author":"JS Pang","year":"1993","unstructured":"Pang, J.S., Qi, L.: Nonsmooth equations: motivation and algorithms. SIAM J. Optim. 3(3), 443\u2013465 (1993)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1629_CR81","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"key":"1629_CR82","unstructured":"Paszke, A., Gross, S., Chintala, S., Chanan, G., Yang, E., DeVito, Z., Lin, Z., Desmaison, A., Antiga, L., Lerer, A.: Automatic differentiation in Pytorch. In: Proceedings of the 31th International Conference on Neural Information Processing Systems (2017)"},{"key":"1629_CR83","doi-asserted-by":"crossref","unstructured":"Patrinos, P., Stella, L., Bemporad, A.: Forward-backward truncated Newton methods for convex composite optimization (2014). http:\/\/arxiv.org\/abs\/1402.6655","DOI":"10.1109\/CDC.2013.6760233"},{"key":"1629_CR84","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, 1\u201348 (2020)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1629_CR85","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1137\/15M1021106","volume":"27","author":"M Pilanci","year":"2017","unstructured":"Pilanci, M., Wainwright, M.J.: Newton sketch: a near linear-time optimization algorithm with linear-quadratic convergence. SIAM J. Optim. 27(1), 205\u2013245 (2017)","journal-title":"SIAM J. Optim."},{"key":"1629_CR86","unstructured":"Poon, C., Liang, J., Schoenlieb, C.: Local convergence properties of SAGA\/Prox-SVRG and acceleration. In: Proceedings of the 35th International Conference on Machine Learning, 80: 4124\u20134132 (2018)"},{"issue":"1","key":"1629_CR87","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1287\/moor.18.1.227","volume":"18","author":"L Qi","year":"1993","unstructured":"Qi, L.: Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18(1), 227\u2013244 (1993)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"1629_CR88","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0167-6377(97)00012-6","volume":"20","author":"L Qi","year":"1997","unstructured":"Qi, L.: On superlinear convergence of quasi-Newton methods for nonsmooth equations. Oper. Res. Lett. 20(5), 223\u2013228 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1629_CR89","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(3), 353\u2013367 (1993)","journal-title":"Math. Program."},{"key":"1629_CR90","unstructured":"Reddi, S.J., Hefny, A., Sra, S., P\u00f3czos, B., Smola, A.J.: Stochastic variance reduction for nonconvex optimization. In: Proceedings of the 33th International Conference on Machine Learning, 314\u2013323 (2016)"},{"key":"1629_CR91","unstructured":"Reddi, S.J., Sra, S., P\u00f3czos, B., Smola, A.J.: Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization. In: Advances in Neural Information Processing Systems, 1145\u20131153 (2016)"},{"key":"1629_CR92","doi-asserted-by":"crossref","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":"1629_CR93","doi-asserted-by":"crossref","unstructured":"Robbins, H., Siegmund, D.: A convergence theorem for non negative almost supermartingales and some applications. In: Optimizing Methods in Statistics, pp. 233\u2013257. Academic Press (1971)","DOI":"10.1016\/B978-0-12-604550-5.50015-8"},{"key":"1629_CR94","unstructured":"Rodomanov, A., Kropotov, D.: A superlinearly-convergent proximal Newton-type method for the optimization of finite sums. In: Proceeding of the 33rd International Conference on Machine Learning, 2597\u20132605 (2016)"},{"key":"1629_CR95","first-page":"1","volume":"76","author":"F Roosta-Khorasani","year":"2018","unstructured":"Roosta-Khorasani, F., Mahoney, M.W.: Sub-sampled Newton methods. Math. Program. 76, 1\u201334 (2018)","journal-title":"Math. Program."},{"key":"1629_CR96","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.neunet.2014.09.003","volume":"61","author":"J Schmidhuber","year":"2015","unstructured":"Schmidhuber, J.: Deep learning in neural networks: an overview. Neural Netw. 61, 85\u2013117 (2015)","journal-title":"Neural Netw."},{"issue":"1\u20132","key":"1629_CR97","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Le Roux, N., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1\u20132), 83\u2013112 (2017)","journal-title":"Math. Program."},{"key":"1629_CR98","unstructured":"Schraudolph, N.N., Yu, J., G\u00fcnter, S.: A stochastic quasi-Newton method for online convex optimization. In: Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, 436\u2013443 (2007)"},{"key":"1629_CR99","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, Cambridge (2014)"},{"key":"1629_CR100","first-page":"1865","volume":"12","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Tewari, A.: Stochastic methods for $$\\ell _1$$-regularized loss minimization. J. Mach. Learn. Res. 12, 1865\u20131892 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1629_CR101","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14, 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"1\u20132","key":"1629_CR102","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":"1629_CR103","first-page":"713","volume":"11","author":"J Shi","year":"2010","unstructured":"Shi, J., Yin, W., Osher, S., Sajda, P.: A fast hybrid algorithm for large-scale $$\\ell _1$$-regularized logistic regression. J. Mach. Learn. Res. 11, 713\u2013741 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"1629_CR104","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"},{"key":"1629_CR105","unstructured":"Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. http:\/\/arxiv.org\/abs\/1409.1556 (2014)"},{"issue":"3","key":"1629_CR106","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10589-017-9912-y","volume":"67","author":"L Stella","year":"2017","unstructured":"Stella, L., Themelis, A., Patrinos, P.: Forward-backward quasi-Newton methods for nonsmooth optimization problems. Comput. Optim. Appl. 67(3), 443\u2013487 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1629_CR107","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1137\/S1052623494274970","volume":"7","author":"D Sun","year":"1997","unstructured":"Sun, D., Han, J.: Newton and quasi-Newton methods for a class of nonsmooth equations and related problems. SIAM J. Optim. 7(2), 463\u2013480 (1997)","journal-title":"SIAM J. Optim."},{"key":"1629_CR108","unstructured":"Sutskever, I., Martens, J., Dahl, G., Hinton, G.: On the importance of initialization and momentum in deep learning. In: Proceedings of the 30th International Conference on Macine Learning, 1139\u20131147 (2013)"},{"issue":"3","key":"1629_CR109","doi-asserted-by":"crossref","first-page":"2274","DOI":"10.1137\/16M1080240","volume":"28","author":"A Themelis","year":"2018","unstructured":"Themelis, A., Stella, L., Patrinos, P.: Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms. SIAM J. Optim. 28(3), 2274\u20132303 (2018)","journal-title":"SIAM J. Optim."},{"key":"1629_CR110","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":"42","key":"1629_CR111","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":"4","key":"1629_CR112","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/s10898-010-9629-2","volume":"50","author":"X Wang","year":"2011","unstructured":"Wang, X., Ma, C., Li, M.: A globally and superlinearly convergent quasi-Newton method for general box constrained variational inequalities without smoothing approximation. J. Global Optim. 50(4), 675\u2013694 (2011)","journal-title":"J. Global Optim."},{"issue":"2","key":"1629_CR113","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/15M1053141","volume":"27","author":"X Wang","year":"2017","unstructured":"Wang, X., Ma, S., Goldfarb, D., Liu, W.: Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization. SIAM J. Optim. 27(2), 927\u2013956 (2017)","journal-title":"SIAM J. Optim."},{"key":"1629_CR114","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."},{"key":"1629_CR115","unstructured":"Wang, Z., Ji, K., Zhou, Y., Liang, Y., Tarokh, V.: Spiderboost and momentum: faster stochastic variance reduction algorithms. In: Proceedings of the 33rd International Conference on Neural Information Processing Systems (2019)"},{"issue":"4","key":"1629_CR116","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Yin, W., Goldfarb, D., Zhang, Y.: A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation. SIAM J. Sci. Comput. 32(4), 1832\u20131857 (2010)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"1629_CR117","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 gradient method with progressive variance reduction. SIAM J. Optim. 24(4), 2057\u20132075 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1629_CR118","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/s10915-017-0624-3","volume":"76","author":"X Xiao","year":"2018","unstructured":"Xiao, X., Li, Y., Wen, Z., Zhang, L.: A regularized semi-smooth Newton method with projection steps for composite convex programs. J. Sci. Comput. 76(1), 364\u2013389 (2018)","journal-title":"J. Sci. Comput."},{"key":"1629_CR119","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10107-019-01405-z","volume":"184","author":"P Xu","year":"2019","unstructured":"Xu, P., Roosta, F., Mahoney, M.W.: Newton-type methods for non-convex optimization under inexact Hessian information. Math. Program. 184, 35\u201370 (2019)","journal-title":"Math. Program."},{"key":"1629_CR120","unstructured":"Xu, P., Yang, J., Roosta-Khorasani, F., R\u00e9, C., Mahoney, M.W.: Sub-sampled Newton methods with non-uniform sampling. In: Proceedings of the 30th International Conference on Neural Information Processing Systems, pp. 3008\u20133016 (2016)"},{"issue":"3","key":"1629_CR121","doi-asserted-by":"crossref","first-page":"1686","DOI":"10.1137\/140983938","volume":"25","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Yin, W.: Block stochastic gradient iteration for convex and nonconvex optimization. SIAM J. Optim. 25(3), 1686\u20131716 (2015)","journal-title":"SIAM J. Optim."},{"key":"1629_CR122","unstructured":"Ye, H., Luo, L., Zhang, Z.: Approximate Newton methods and their local convergence. In: Proceedings of the 34th International Conference on Machine Learning, 70: 3931\u20133939 (2017)"},{"key":"1629_CR123","doi-asserted-by":"crossref","unstructured":"You, Y., Zhang, Z., Hsieh, C.J., Demmel, J., Keutzer, K.: ImageNet training in minutes. In: Proceedings of the 47th International Conference on Parallel Processing, 1\u201310 (2018)","DOI":"10.1145\/3225058.3225069"},{"key":"1629_CR124","first-page":"1999","volume":"13","author":"GX Yuan","year":"2012","unstructured":"Yuan, G.X., Ho, C.H., Lin, C.J.: An improved GLMNET for $$\\ell _1$$-regularized logistic regression. J. Mach. Learn. Res. 13, 1999\u20132030 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"1629_CR125","unstructured":"Zhang, H., Reddi, S.J., Sra, S.: Riemannian SVRG: fast stochastic optimization on Riemannian manifolds. In: Advances in Neural Information Processing Systems, 4592\u20134600 (2016)"},{"key":"1629_CR126","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1109\/TSP.2017.2784360","volume":"66","author":"R Zhao","year":"2017","unstructured":"Zhao, R., Haskell, W.B., Tan, V.Y.: Stochastic L-BFGS: improved convergence rates and practical acceleration strategies. IEEE Trans. Signal Process 66, 1155\u20131169 (2017)","journal-title":"IEEE Trans. Signal Process"},{"key":"1629_CR127","unstructured":"Zhou, D., Xu, P., Gu, Q.: Stochastic nested variance reduction for nonconvex optimization. J. Mach. Learn. Res. 21, 1\u201363 (2018)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01629-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-021-01629-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-021-01629-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T12:17:32Z","timestamp":1656591452000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-021-01629-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,13]]},"references-count":127,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1629"],"URL":"https:\/\/doi.org\/10.1007\/s10107-021-01629-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,13]]},"assertion":[{"value":"22 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}