{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:31:34Z","timestamp":1740123094450,"version":"3.37.3"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T00:00:00Z","timestamp":1561507200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T00:00:00Z","timestamp":1561507200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10994-019-05819-w","type":"journal-article","created":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T19:03:25Z","timestamp":1561575805000},"page":"103-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Provable accelerated gradient method for nonconvex low rank optimization"],"prefix":"10.1007","volume":"109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1286-6552","authenticated-orcid":false,"given":"Huan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhouchen","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"key":"5819_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, N., Allen-Zhu, Z., Bullins, B., Hazan, E., & Ma, T. (2017). Finding approximate local minima faster than gradient descent. In STOC.","DOI":"10.1145\/3055399.3055464"},{"key":"5819_CR2","doi-asserted-by":"crossref","unstructured":"Allen-Zhu, Z. (2017). Katyusha: The first direct acceleration of stochastic gradient methods. In STOC.","DOI":"10.1145\/3055399.3055448"},{"issue":"4","key":"5819_CR3","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/120867287","volume":"34","author":"H Avron","year":"2013","unstructured":"Avron, H., & Boutsidis, C. (2013). Faster subset selection for matrices and applications. SIAM Journal on Matrix Analysis and Applications, 34(4), 1464\u20131499.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"5819_CR4","unstructured":"Bhojanapalli, S., Kyrillidis, A., & Sanghavi, S. (2016). Dropping convexity for faster semi-definite optimization. In COLT."},{"key":"5819_CR5","unstructured":"Bhojanapalli, S., Neyshabur, B., & Srebro, N. (2016). Global optimality of local search for low rank matrix recovery. In NIPS."},{"key":"5819_CR6","unstructured":"Boumal, N., Voroninski, V., & Bandeira, A. (2016). The non-convex Burer\u2013Monteiro approach works on smooth semidefinite programs. In NIPS."},{"issue":"2","key":"5819_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S Burer","year":"2003","unstructured":"Burer, S., & Monteiro, R. (2003). A nonlinaer programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming, 95(2), 329\u2013357.","journal-title":"Mathematical Programming"},{"issue":"3","key":"5819_CR8","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-004-0564-1","volume":"103","author":"S Burer","year":"2005","unstructured":"Burer, S., & Monteiro, R. (2005). Local minima and convergence in low-rank semidefinite programming. Mathematical Programming, 103(3), 427\u2013444.","journal-title":"Mathematical Programming"},{"issue":"6","key":"5819_CR9","doi-asserted-by":"publisher","first-page":"3074","DOI":"10.1214\/13-AOS1178","volume":"41","author":"T Cai","year":"2013","unstructured":"Cai, T., Ma, Z., & Wu, Y. (2013). Sparse PCA: Optimal rates and adaptive estimation. The Annals of Statistics, 41(6), 3074\u20133110.","journal-title":"The Annals of Statistics"},{"issue":"6","key":"5819_CR10","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717\u2013772.","journal-title":"Foundations of Computational Mathematics"},{"issue":"2","key":"5819_CR11","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1137\/17M1114296","volume":"28","author":"Y Carmon","year":"2018","unstructured":"Carmon, Y., Duchi, J., Hinder, O., & Sidford, A. (2018). Accelerated methods for non-convex optimization. SIAM Journal on Optimization, 28(2), 1751\u20131772.","journal-title":"SIAM Journal on Optimization"},{"key":"5819_CR12","unstructured":"Carmon, Y., Hinder, O., Duchi, J., & Sidford, A. (2017). Convex until proven guilty: Dimension-free acceleration of gradient descent on non-convex functions. In ICML."},{"key":"5819_CR13","unstructured":"Chen, Y., & Wainwright, M. (2015). Fast low-rank estimation by projected gradient descent: General statistical and algoritmic guarantees. arxiv:1509.03025 ."},{"issue":"3","key":"5819_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1093\/imaiai\/iau006","volume":"3","author":"M Davenport","year":"2014","unstructured":"Davenport, M., Plan, Y., Van Den Berg, E., & Wootters, M. (2014). 1-bit matrix completion. Information and Inference, 3(3), 189\u2013223.","journal-title":"Information and Inference"},{"issue":"4","key":"5819_CR15","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/0609045","volume":"9","author":"A Edelman","year":"1988","unstructured":"Edelman, A. (1988). Eigenvalues and condition numbers of random matrices. SIAM Journal on Matrix Analysis and Applications, 9(4), 543\u2013560.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"5819_CR16","unstructured":"Ge, R., Jin, C., & Zheng, Y. (2017). No spurious local minima in nonconvex low rank problems: A unified geometric analysis. In ICML."},{"key":"5819_CR17","unstructured":"Ge, R., Lee, J., & Ma, T. (2016). Matrix completion has no spurious local minimum. In NIPS."},{"issue":"1\u20132","key":"5819_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., & Lan, G. (2016). Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Mathematical Programming, 156(1\u20132), 59\u201399.","journal-title":"Mathematical Programming"},{"key":"5819_CR19","unstructured":"Gu, Q., Wang, Z., & Liu, H. (2016). Low-rank and sparse structure pursuit via alternating minimization. In AISTATS."},{"key":"5819_CR20","doi-asserted-by":"crossref","unstructured":"Guruswami, V., & Sinop, A. (2012). Optimal column-based low-rank matrix reconstruction. In SODA.","DOI":"10.1137\/1.9781611973099.95"},{"issue":"2","key":"5819_CR21","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P., & Tropp, J. (2011). Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 53(2), 217\u2013288.","journal-title":"SIAM Review"},{"key":"5819_CR22","unstructured":"Hardt, M., & Wootters, M. (2014). Fast matrix completion without the condition number. In COLT."},{"issue":"1","key":"5819_CR23","first-page":"3367","volume":"16","author":"T Hastie","year":"2015","unstructured":"Hastie, T., Mazumder, R., Lee, J., & Zadeh, R. (2015). Matrix completion and low-rank SVD via fast alternating least squares. Journal of Machine Learning Research, 16(1), 3367\u20133402.","journal-title":"Journal of Machine Learning Research"},{"key":"5819_CR24","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., & Sanghavi, S. (2013). Low-rank matrix completion using alternating minimization. In STOC.","DOI":"10.1145\/2488608.2488693"},{"key":"5819_CR25","unstructured":"Jin, C., Ge, R., Netrapalli, P., & Kakade, S. (2018). How to escape saddle points efficiently. In ICML."},{"key":"5819_CR26","unstructured":"Jin, C., Netrapalli, P., & Jordan, M. (2018). Accelerated gradient descent escapes saddle points faster than gradient descent. In COLT."},{"issue":"5","key":"5819_CR27","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1214\/11-AOS894","volume":"39","author":"V Koltchinsii","year":"2011","unstructured":"Koltchinsii, V., Lounici, K., & Tsybakov, A. (2011). Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. The Annals of Statistics, 39(5), 2302\u20132329.","journal-title":"The Annals of Statistics"},{"key":"5819_CR28","doi-asserted-by":"crossref","unstructured":"Larsen, R. (1998). Lanczos bidiagonalization with partial reorthogonalization. Technical report, Aarhus University.","DOI":"10.7146\/dpb.v27i537.7070"},{"key":"5819_CR29","unstructured":"Li, H., & Lin, Z. (2015). Accelerated proximal gradient methods for nonconvex programming. In NIPS."},{"issue":"1","key":"5819_CR30","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1093\/imaiai\/iay003","volume":"8","author":"Q Li","year":"2018","unstructured":"Li, Q., Zhu, Z., & Tang, G. (2018). The non-convex geometry of low-rank matrix optimization. Information and Inference: A Journal of the IMA, 8(1), 51\u201396.","journal-title":"Information and Inference: A Journal of the IMA"},{"issue":"1","key":"5819_CR31","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1137\/S0895479893256359","volume":"16","author":"R Li","year":"1995","unstructured":"Li, R. (1995). New perturbation bounds for the unitary polar factor. SIAM Journal on Matrix Analysis and Applications, 16(1), 327\u2013332.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"5819_CR32","unstructured":"Li, X., Wang, Z., Lu, J., Arora, R., Haupt, J., Liu, H., et al. (2016). Symmetry, saddle points, and global geometry of nonconvex matrix factorization. arxiv:1612.09296 ."},{"key":"5819_CR33","unstructured":"Lin, H., Mairal, J., & Harchaoui, Z. (2015). A universal catalyst for first-order optimization. In NIPS."},{"key":"5819_CR34","unstructured":"Lin, M., & Ye, J. (2016). A non-convex one-pass framework for generalized factorization machines and rank-one matrix sensing. In NIPS."},{"issue":"21","key":"5819_CR35","doi-asserted-by":"publisher","first-page":"5623","DOI":"10.1109\/TSP.2016.2586753","volume":"64","author":"G Liu","year":"2016","unstructured":"Liu, G., & Li, P. (2016). Low-rank matrix completion in the presence of high coherence. IEEE Transactions on Signal Processing, 64(21), 5623\u20135633.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"5819_CR36","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1109\/TPAMI.2012.88","volume":"35","author":"G Liu","year":"2013","unstructured":"Liu, G., Lin, Z., Yan, S., Sun, J., & Ma, Y. (2013). Robust recovery of subspace structures by low-rank representation. IEEE Transactions Pattern Analysis and Machine Intelligence, 35(1), 171\u2013184.","journal-title":"IEEE Transactions Pattern Analysis and Machine Intelligence"},{"issue":"1\u20132","key":"5819_CR37","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Yu., & Glineur, F. (2019). Linear convergence of first order methods for non-strongly convex optimization. Mathematical Programming, 175(1\u20132), 69\u2013107.","journal-title":"Mathematical Programming"},{"issue":"2","key":"5819_CR38","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1214\/10-AOS850","volume":"39","author":"S Negahban","year":"2011","unstructured":"Negahban, S., & Wainwright, M. (2011). Estimation of (near) low-rank maatrices with noise and high-dimensional scaling. The Annals of Statistics, 39(2), 109\u20131097.","journal-title":"The Annals of Statistics"},{"issue":"May","key":"5819_CR39","first-page":"1665","volume":"13","author":"S Negahban","year":"2012","unstructured":"Negahban, S., & Wainwright, M. (2012). Resticted strong convexity and weighted matrix completion: Optimal bounds with noise. Journal of Machine Learning Research, 13(May), 1665\u20131697.","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"5819_CR40","first-page":"372","volume":"27","author":"Yu Nesterov","year":"1983","unstructured":"Nesterov, Yu. (1983). A method for unconstrained convex minimization problem with the rate of convergence $${O}(1\/k^2)$$. Soviet Mathematics Doklady, 27(2), 372\u2013376.","journal-title":"Soviet Mathematics Doklady"},{"key":"5819_CR41","first-page":"509","volume":"24","author":"Yu Nesterov","year":"1988","unstructured":"Nesterov, Yu. (1988). On an approach to the construction of optimal methods of minimization of smooth convex functions. Ekonomika i Mateaticheskie Metody, 24, 509\u2013517.","journal-title":"Ekonomika i Mateaticheskie Metody"},{"volume-title":"Introductory lectures on convex optimization: A basic course","year":"2004","key":"5819_CR42","unstructured":"Nesterov, Yu. (Ed.). (2004). Introductory lectures on convex optimization: A basic course. Berlin: Springer."},{"key":"5819_CR43","unstructured":"Park, D., Kyrillidis, A., Bhojanapalli, S., Caramanis, C., & Sanghavi, S. (2016). Provable Burer-Monteiro factorization for a class of norm-constrained matrix problems. arxiv:1606.01316 ."},{"issue":"4","key":"5819_CR44","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/17M1150189","volume":"11","author":"D Park","year":"2018","unstructured":"Park, D., Kyrillidis, A., Caramanis, C., & Sanghavi, S. (2018). Finding low-rank solutions via non-convex matrix factorization, efficiently and provably. SIAM Journal on Image Science, 11(4), 333\u2013361.","journal-title":"SIAM Journal on Image Science"},{"key":"5819_CR45","unstructured":"Park, D., Netrapalli, P., & Sanghavi, S. (2013). Low-rank matrix completion using alternating minimization. In STOC."},{"issue":"3","key":"5819_CR46","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., & Parrilo, P. (2010). Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Review, 52(3), 471\u2013501.","journal-title":"SIAM Review"},{"issue":"2","key":"5819_CR47","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1214\/10-AOS860","volume":"39","author":"A Rohde","year":"2011","unstructured":"Rohde, A., & Tsybakov, A. (2011). Estimation of high-dimensional low-rank matrices. The Annals of Statistics, 39(2), 887\u2013930.","journal-title":"The Annals of Statistics"},{"issue":"1","key":"5819_CR48","doi-asserted-by":"publisher","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. (2017). Minimizing finite sums with the stochastic average gradient. Mathematical Programming, 162(1), 83\u2013112.","journal-title":"Mathematical Programming"},{"issue":"Feb","key":"5819_CR49","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., & Zhang, T. (2013). Stochastic dual coordinate ascent methods for regularized loss minimization. Journal of Machine Learning Research, 14(Feb), 567\u2013599.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"5819_CR50","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10107-014-0839-0","volume":"155","author":"S Shalev-Shwartz","year":"2016","unstructured":"Shalev-Shwartz, S., & Zhang, T. (2016). Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization. Mathematical Programming, 155(1), 105\u2013145.","journal-title":"Mathematical Programming"},{"issue":"2","key":"5819_CR51","doi-asserted-by":"publisher","first-page":"197","DOI":"10.4310\/SII.2013.v6.n2.a4","volume":"6","author":"Y She","year":"2013","unstructured":"She, Y. (2013). Reduced rank vector generalized linear models for feature extraction. Statistics and Its Interface, 6(2), 197\u2013209.","journal-title":"Statistics and Its Interface"},{"key":"5819_CR52","doi-asserted-by":"crossref","unstructured":"Sun, R., & Luo, Z. (2015). Guaranteed matrix completion via nonconvex factorization. In FOCS.","DOI":"10.1109\/FOCS.2015.25"},{"key":"5819_CR53","unstructured":"Sutskever, I., Martens, J., Dahl, G., & Hinton, G. (2013). On the importance of initialization and momentum in deep learning. In ICML."},{"key":"5819_CR54","unstructured":"Tseng, P. (2008). On accelerated proximal gradient methods for convex-concave optimization. Technical report, University of Washington, Seattle."},{"key":"5819_CR55","unstructured":"Tu, S., Boczar, R., Soltanolkotabi, M., & Recht, B. (2016). Low-rank solutions of linear matrix equations via procrustes flow. In ICML."},{"key":"5819_CR56","unstructured":"Wagner, A., & Zuk, O. (2015). Low-rank matrix recovery from row-and-column affine measurements. In ICML."},{"key":"5819_CR57","unstructured":"Wang, L., Zhang, X., & Gu, Q. (2017). A unified computational and statistical framework for nonconvex low rank matrix estimation. In AISTATS."},{"key":"5819_CR58","unstructured":"Waters, A., Sankaranarayanan, A., & Baraniuk, R. (2011). SpaRCS: Recovering low rank and sparse matrices from compressive measurements. In NIPS."},{"issue":"4","key":"5819_CR59","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., & Zhang, Y. (2012). Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Mathematical Programming Computation, 4(4), 333\u2013361.","journal-title":"Mathematical Programming Computation"},{"key":"5819_CR60","unstructured":"Woodworth, B., & Srebro, N. (2016). Tight complexity bounds for optimizing composite objectives. In NIPS."},{"issue":"4","key":"5819_CR61","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., & Zhang, T. (2014). A proximal stochastic gradient method with progressive variance reduction. SIAM Journal on Optimization, 24(4), 2057\u20132075.","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"5819_CR62","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/s10915-017-0376-0","volume":"72","author":"Y Xu","year":"2014","unstructured":"Xu, Y., & Yin, W. (2014). A globally convergent algorithm for nonconvex optimization based on block coordinate update. Journal of Scientific Computing, 72(2), 700\u2013734.","journal-title":"Journal of Scientific Computing"},{"key":"5819_CR63","doi-asserted-by":"crossref","unstructured":"Xu, C., Lin, Z., & Zha, H. (2017). A unified convex surrogate for the Schatten-$$p$$ norm. In AAAI.","DOI":"10.1609\/aaai.v31i1.10646"},{"issue":"1","key":"5819_CR64","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1191\/1471082X03st045oa","volume":"3","author":"T Yee","year":"2000","unstructured":"Yee, T., & Hastie, T. (2000). Reduced-rank vector generalized linear models. Statistical Modelling, 3(1), 15\u201341.","journal-title":"Statistical Modelling"},{"key":"5819_CR65","unstructured":"Yi, X., Park, D., Chen, Y., & Caramanis, C. (2016). Fast algorithms for robust PCA via gradient descent. In NIPS."},{"key":"5819_CR66","unstructured":"Zhang, Q., & Lafferty, J. (2015). A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements. In NIPS."},{"key":"5819_CR67","unstructured":"Zhang, X., Wang, L., Yu, Y., & Gu, Q. (2018). A primal-dual analysis of global optimality in nonconvex low-rank matrix recovery. In ICML."},{"key":"5819_CR68","unstructured":"Zhao, T., Wang, Z., & Liu, H. (2015). A nonconvex optimization framework for low rank matrix estimation. In NIPS."},{"key":"5819_CR69","unstructured":"Zheng, Q., & Lafferty, J. (2016). Convergence analysis for rectangular matrix completion using Burer\u2013Monteiro factorization and gradient descent. arxiv:1605.07051 ."},{"key":"5819_CR70","unstructured":"Zhu, Z., Li, Q., Tang, G., & Wakin, M. (2018). The global optimization geometry on low-rank matrix optimization. arxiv:1703.01256 ."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05819-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-019-05819-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05819-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T01:03:24Z","timestamp":1663808604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-019-05819-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,26]]},"references-count":70,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["5819"],"URL":"https:\/\/doi.org\/10.1007\/s10994-019-05819-w","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2019,6,26]]},"assertion":[{"value":"28 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}