{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:22:36Z","timestamp":1773894156046,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1319050"],"award-info":[{"award-number":["1319050"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1254446"],"award-info":[{"award-number":["1254446"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1115568"],"award-info":[{"award-number":["1115568"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIP-1237814"],"award-info":[{"award-number":["IIP-1237814"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s10107-017-1161-4","type":"journal-article","created":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T06:49:57Z","timestamp":1496299797000},"page":"113-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":64,"title":["Accelerated schemes for a class of variational inequalities"],"prefix":"10.1007","volume":"165","author":[{"given":"Yunmei","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2103-087X","authenticated-orcid":false,"given":"Guanghui","family":"Lan","sequence":"additional","affiliation":[]},{"given":"Yuyuan","family":"Ouyang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,1]]},"reference":[{"key":"1161_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-004-0568-x","volume":"104","author":"A Auslender","year":"2005","unstructured":"Auslender, A., Teboulle, M.: Interior projection-like methods for monotone variational inequalities. Math. Program. 104, 39\u201368 (2005)","journal-title":"Math. Program."},{"key":"1161_CR2","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/S1052623403427823","volume":"16","author":"A Auslender","year":"2006","unstructured":"Auslender, A., Teboulle, M.: Interior gradient and proximal methods for convex and conic optimization. SIAM J. Optim. 16, 697\u2013725 (2006)","journal-title":"SIAM J. Optim."},{"key":"1161_CR3","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10107-004-0553-4","volume":"102","author":"A Ben-Tal","year":"2005","unstructured":"Ben-Tal, A., Nemirovski, A.: Non-Euclidean restricted memory level method for large-scale convex optimization. Math. Program. 102, 407\u2013456 (2005)","journal-title":"Math. Program."},{"key":"1161_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/10556789208805504","volume":"1","author":"KP Bennett","year":"1992","unstructured":"Bennett, K.P., Mangasarian, O.L.: Robust linear programming discrimination of two linearly inseparable sets. Optim. Methods Softw. 1, 23\u201334 (1992)","journal-title":"Optim. Methods Softw."},{"key":"1161_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge university press, Cambridge (2004)"},{"key":"1161_CR6","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"LM Bregman","year":"1967","unstructured":"Bregman, L.M.: The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR comput. Math. Math. Phys. 7, 200\u2013217 (1967)","journal-title":"USSR comput. Math. Math. Phys."},{"key":"1161_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1008615624787","volume":"5","author":"RS Burachik","year":"1997","unstructured":"Burachik, R.S., Iusem, A.N., Svaiter, B.F.: Enlargement of monotone operators with applications to variational inequalities. Set-Valued Anal. 5, 159\u2013180 (1997)","journal-title":"Set-Valued Anal."},{"key":"1161_CR8","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1137\/110825248","volume":"22","author":"X Chen","year":"2012","unstructured":"Chen, X., Wets, R.J.-B., Zhang, Y.: Stochastic variational inequalities: residual minimization smoothing sample average approximations. SIAM J. Optim. 22, 649\u2013673 (2012)","journal-title":"SIAM J. Optim."},{"key":"1161_CR9","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1137\/S0363012997315907","volume":"37","author":"X Chen","year":"1999","unstructured":"Chen, X., Ye, Y.: On homotopy-smoothing methods for box-constrained variational inequalities. SIAM J. Control Optim. 37, 589\u2013616 (1999)","journal-title":"SIAM J. Control Optim."},{"key":"1161_CR10","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems. SIAM J. Optim. 24, 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"key":"1161_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10589-014-9673-9","volume":"60","author":"CD Dang","year":"2015","unstructured":"Dang, C.D., Lan, G.: On the convergence properties of non-euclidean extragradient methods for variational inequalities with generalized monotone operators. Comput. Optim. Appl. 60, 277\u2013310 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"1161_CR12","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. 1. Springer, Berlin (2003)"},{"key":"1161_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF00935344","volume":"38","author":"SC Fang","year":"1982","unstructured":"Fang, S.C., Peterson, E.: Generalized variational inequalities. J. Optim. Theory Appl. 38, 363\u2013383 (1982)","journal-title":"J. Optim. Theory Appl."},{"key":"1161_CR14","doi-asserted-by":"publisher","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, 1469\u20131492 (2012)","journal-title":"SIAM J. Optim."},{"key":"1161_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2015","unstructured":"Ghadimi, S., Lan, G.: Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Math. Program. 156, 59\u201399 (2015)","journal-title":"Math. Program."},{"key":"1161_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02392210","volume":"115","author":"P Hartman","year":"1966","unstructured":"Hartman, P., Stampacchia, G.: On some non-linear elliptic differential-functional equations. Acta Math. 115, 271\u2013310 (1966)","journal-title":"Acta Math."},{"key":"1161_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T Hastie","year":"2009","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction, 2nd edn. Springer, Berlin (2009)","edition":"2"},{"key":"1161_CR18","doi-asserted-by":"crossref","unstructured":"Jacob, L., Obozinski, G., Vert, J.-P.: Group lasso with overlap and graph lasso. In: Proceedings of the 26th Annual International Conference on Machine Learning, ACM, pp.\u00a0433\u2013440. (2009)","DOI":"10.1145\/1553374.1553431"},{"key":"1161_CR19","doi-asserted-by":"publisher","first-page":"1462","DOI":"10.1109\/TAC.2008.925853","volume":"53","author":"H Jiang","year":"2008","unstructured":"Jiang, H., Xu, H.: Stochastic approximation approaches to the stochastic variational inequality problem. IEEE Trans. Autom. Control 53, 1462\u20131475 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1161_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/10-SSY011","volume":"1","author":"A Juditsky","year":"2011","unstructured":"Juditsky, A., Nemirovski, A., Tauvel, C.: Solving variational inequalities with stochastic mirror-prox algorithm. Stoch. Syst. 1, 17\u201358 (2011)","journal-title":"Stoch. Syst."},{"key":"1161_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10898-007-9251-0","volume":"41","author":"B Kien","year":"2008","unstructured":"Kien, B., Yao, J.-C., Yen, N.D.: On the solution existence of pseudomonotone variational inequalities. J. Glob. Optim. 41, 135\u2013145 (2008)","journal-title":"J. Glob. Optim."},{"key":"1161_CR22","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"},{"key":"1161_CR23","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TAC.2012.2215413","volume":"58","author":"J Koshal","year":"2013","unstructured":"Koshal, J., Nedic, A., Shanbhag, U.V.: Regularized iterative stochastic approximation methods for stochastic variational inequality problems. IEEE Trans. Autom. Control 58, 594\u2013609 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"1161_CR24","doi-asserted-by":"publisher","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":"1161_CR25","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10107-011-0442-6","volume":"134","author":"G Lan","year":"2012","unstructured":"Lan, G., Nemirovski, A., Shapiro, A.: Validation analysis of mirror descent stochastic approximation method. Math. Program. 134, 425\u2013458 (2012)","journal-title":"Math. Program."},{"key":"1161_CR26","first-page":"455","volume":"6","author":"G-H Lin","year":"2010","unstructured":"Lin, G.-H., Fukushima, M.: Stochastic equilibrium problems and stochastic mathematical programs with equilibrium constraints: a survey. Pac. J. Optim. 6, 455\u2013482 (2010)","journal-title":"Pac. J. Optim."},{"key":"1161_CR27","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1215\/S0012-7094-62-02933-2","volume":"29","author":"GJ Minty","year":"1962","unstructured":"Minty, G.J., et al.: Monotone (nonlinear) operators in hilbert space. Duke Math. J. 29, 341\u2013346 (1962)","journal-title":"Duke Math. J."},{"key":"1161_CR28","doi-asserted-by":"publisher","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RD Monteiro","year":"2010","unstructured":"Monteiro, R.D., Svaiter, B.F.: On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean. SIAM J. Optim. 20, 2755\u20132787 (2010)","journal-title":"SIAM J. Optim."},{"key":"1161_CR29","doi-asserted-by":"publisher","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 F-B splitting and Korpelevich\u2019s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems. SIAM J. Optim. 21, 1688\u20131720 (2011)","journal-title":"SIAM J. Optim."},{"key":"1161_CR30","unstructured":"MOSEK ApS, The MOSEK optimization toolbox for Matlab manual, version 6.0 (revision 135). MOSEK ApS, Denmark, (2012)"},{"key":"1161_CR31","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0885-064X(92)90013-2","volume":"8","author":"A Nemirovski","year":"1992","unstructured":"Nemirovski, A.: Information-based complexity of linear operator equations. J. Complex. 8, 153\u2013175 (1992)","journal-title":"J. Complex."},{"key":"1161_CR32","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence $${O}(1\/t)$$ for variational inequalities with Lipschitz continuous monotone operators and smooth convex\u2013concave saddle point problems. SIAM J. Optim. 15, 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"key":"1161_CR33","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19, 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"1161_CR34","series-title":"Wiley-interscience series in discrete mathematics","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A Nemirovski","year":"1983","unstructured":"Nemirovski, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization. Wiley-interscience series in discrete mathematics. Wiley, NewYork (1983)"},{"key":"1161_CR35","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-006-0034-z","volume":"109","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Program. 109, 319\u2013344 (2007)","journal-title":"Math. Program."},{"key":"1161_CR36","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s10107-014-0790-0","volume":"152","author":"Y Nesterov","year":"2015","unstructured":"Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program. 152, 381\u2013404 (2015)","journal-title":"Math. Program."},{"key":"1161_CR37","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1137\/S1052623497324813","volume":"9","author":"Y Nesterov","year":"1999","unstructured":"Nesterov, Y., Vial, J.P.: Homogeneous analytic center cutting plane methods for convex problems and variational inequalities. SIAM J. Optim. 9, 707\u2013728 (1999)","journal-title":"SIAM J. Optim."},{"key":"1161_CR38","first-page":"543","volume":"269","author":"YE Nesterov","year":"1983","unstructured":"Nesterov, Y.E.: A method for unconstrained convex minimization problem with the rate of convergence $$O(1\/k^2)$$. Doklady SSSR 269, 543\u2013547 (1983). Translated as Soviet Math. Docl","journal-title":"Doklady SSSR"},{"key":"1161_CR39","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"YE Nesterov","year":"2005","unstructured":"Nesterov, Y.E.: Smooth minimization of nonsmooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"1161_CR40","doi-asserted-by":"publisher","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, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"1161_CR41","doi-asserted-by":"crossref","unstructured":"Shapiro, A.: Monte carlo sampling methods. In: Shapiro, A., Ruszczy\u0144ski, A. (eds.) Handbooks in Operations Research and Management Science, vol. 10, pp. 353\u2013425. (2003)","DOI":"10.1016\/S0927-0507(03)10006-0"},{"key":"1161_CR42","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1080\/02331930801954177","volume":"57","author":"A Shapiro","year":"2008","unstructured":"Shapiro, A., Xu, H.: Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation. Optimization 57, 395\u2013418 (2008)","journal-title":"Optimization"},{"key":"1161_CR43","first-page":"59","volume":"6","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid projection-proximal point algorithm. J. Convex Anal. 6, 59\u201370 (1999)","journal-title":"J. Convex Anal."},{"key":"1161_CR44","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1287\/moor.25.2.214.12222","volume":"25","author":"MV Solodov","year":"2000","unstructured":"Solodov, M.V., Svaiter, B.F.: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions. Math. Oper. Res. 25, 214\u2013230 (2000)","journal-title":"Math. Oper. Res."},{"key":"1161_CR45","doi-asserted-by":"crossref","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Series B (Methodological), 267\u2013288 (1996)","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"1161_CR46","unstructured":"Tseng, P.: On accelerated proximal gradient methods for convex\u2013concave optimization. Manuscript (2008)"},{"key":"1161_CR47","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"1161_CR48","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1007\/s11424-011-0948-2","volume":"24","author":"M Wang","year":"2011","unstructured":"Wang, M., Lin, G., Gao, Y., Ali, M.M.: Sample average approximation method for a class of stochastic variational inequality problems. J. Syst. Sci. Complex. 24, 1143\u20131153 (2011)","journal-title":"J. Syst. Sci. Complex."},{"key":"1161_CR49","first-page":"505","volume":"15","author":"EP Xing","year":"2003","unstructured":"Xing, E.P., Ng, A.Y., Jordan, M.I., Russell, S.: Distance metric learning with application to clustering with side-information. Adv. Neural Inf. Process. Syst. 15, 505\u2013512 (2003)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1161_CR50","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10589-013-9538-7","volume":"55","author":"H Xu","year":"2013","unstructured":"Xu, H., Zhang, D.: Stochastic nash equilibrium problems: sample average approximation and applications. Computa. Optim. Appl. 55, 597\u2013645 (2013)","journal-title":"Computa. Optim. Appl."},{"key":"1161_CR51","doi-asserted-by":"crossref","unstructured":"Yousefian, F., Nedi\u0107, A., Shanbhag, U.V.: A regularized smoothing stochastic approximation (rssa) algorithm for stochastic variational inequality problems. In: Proceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World, IEEE Press, pp.\u00a0933\u2013944. (2013)","DOI":"10.1109\/WSC.2013.6721484"},{"key":"1161_CR52","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 67, 301\u2013320 (2005)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1161-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1161-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1161-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:19:16Z","timestamp":1589645956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1161-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,1]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["1161"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1161-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,1]]},"assertion":[{"value":"19 August 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}