{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T13:50:10Z","timestamp":1768485010480,"version":"3.49.0"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T00:00:00Z","timestamp":1651190400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T00:00:00Z","timestamp":1651190400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1953210"],"award-info":[{"award-number":["DMS-1953210"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2007797"],"award-info":[{"award-number":["CCF-2007797"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10898-022-01160-0","type":"journal-article","created":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T02:04:55Z","timestamp":1651197895000},"page":"709-740","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Zeroth-order algorithms for nonconvex\u2013strongly-concave minimax problems with improved complexities"],"prefix":"10.1007","volume":"87","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9049-4291","authenticated-orcid":false,"given":"Zhongruo","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnakumar","family":"Balasubramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1967-1069","authenticated-orcid":false,"given":"Shiqian","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meisam","family":"Razaviyayn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,29]]},"reference":[{"key":"1160_CR1","unstructured":"Agarwal, A., Beygelzimer, A., Dudik, M., Langford, J., Wallach, H.: A reductions approach to fair classification. In: International Conference on Machine Learning, pp. 60\u201369 (2018)"},{"key":"1160_CR2","doi-asserted-by":"crossref","unstructured":"Al-Dujaili, A., Srikant, S., Hemberg, E., O\u2019Reilly, U.-M.: On the application of Danskin\u2019s theorem to derivative-free minimax optimization. arXiv preprint arXiv:1805.06322 (2018)","DOI":"10.1063\/1.5089993"},{"key":"1160_CR3","unstructured":"Anagnostidis, S., Lucchi, A., Diouane, Y.: Direct-search methods for a class of non-convex min\u2013max games. In: AISTATS (2021)"},{"key":"1160_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. Springer, Berlin (2017)"},{"key":"1160_CR5","unstructured":"Baharlouei, S., Nouiehed, M., Razaviyayn, M.: R\u00e9nyi fair inference. In: International Conference on Learning Representation (2019)"},{"key":"1160_CR6","unstructured":"Balasubramanian, K., Ghadimi, S.: Zeroth-order (non)-convex stochastic optimization via conditional gradient and gradient updates. In: Advances in Neural Information Processing Systems, pp. 3455\u20133464 (2018)"},{"key":"1160_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10208-021-09499-8","volume":"22","author":"K Balasubramanian","year":"2021","unstructured":"Balasubramanian, K., Ghadimi, S.: Zeroth-order nonconvex stochastic optimization: handling constraints, high-dimensionality, and saddle-points. Found. Comput. Math. 22, 35\u201376 (2021)","journal-title":"Found. Comput. Math."},{"key":"1160_CR8","unstructured":"Bassily, R., Belkin, M., Ma, S.: On exponential convergence of SGD in non-convex over-parametrized learning. arXiv preprint arXiv:1811.02564 (2018)"},{"issue":"2","key":"1160_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10898-009-9496-x","volume":"48","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Nohadani, O.: Robust optimization with simulated annealing. J. Glob. Optim. 48(2), 323\u2013334 (2010)","journal-title":"J. Glob. Optim."},{"key":"1160_CR10","unstructured":"Bogunovic, I., Scarlett, J., Jegelka, S., Cevher, V.: Adversarially robust optimization with Gaussian processes. In: Advances in Neural Information Processing Systems, pp. 5760\u20135770 (2018)"},{"key":"1160_CR11","doi-asserted-by":"crossref","unstructured":"Bubeck, S., Lee, Y.T., Eldan, R.: Kernel-based methods for bandit convex optimization. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 72\u201385. ACM (2017)","DOI":"10.1145\/3055399.3055403"},{"key":"1160_CR12","doi-asserted-by":"crossref","unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 27:1\u201327:27 (2011). Software available at http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm","DOI":"10.1145\/1961189.1961199"},{"key":"1160_CR13","doi-asserted-by":"crossref","unstructured":"Chen, P.-Y., Zhang, H., Sharma, Y., Yi, J., Hsieh, C.-J.: Zoo: zeroth order optimization based black-box attacks to deep neural networks without training substitute models. In: Proceedings of the 10th ACM Workshop on Artificial Intelligence and Security, pp. 15\u201326. ACM (2017)","DOI":"10.1145\/3128572.3140448"},{"key":"1160_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization","author":"A Conn","year":"2009","unstructured":"Conn, A., Scheinberg, K., Vicente, L.: Introduction to Derivative-Free Optimization, vol. 8. SIAM, Philadelphia (2009)"},{"key":"1160_CR15","unstructured":"Dai, B., Shaw, A., Li, L., Xiao, L., He, N., Liu, Z., Chen, J., Song, L.: SBEED: convergent reinforcement learning with nonlinear function approximation. In: Proceedings of the International Conference on Machine Learning (ICML) (2018)"},{"key":"1160_CR16","unstructured":"Daskalakis, C., Ilyas, A., Syrgkanis, V., Zeng, H.: Training GANs with optimism. In: International Conference on Learning Representations (ICLR) (2018)"},{"key":"1160_CR17","unstructured":"Daskalakis, C., Panageas, I.: The limit points of (optimistic) gradient descent in min\u2013max optimization. In: Advances in Neural Information Processing Systems, pp. 9236\u20139246 (2018)"},{"key":"1160_CR18","volume-title":"UCI Machine Learning Repository","author":"D Dua","year":"2017","unstructured":"Dua, D., Graff, C.: UCI Machine Learning Repository. University of California, Irvine (2017)"},{"key":"1160_CR19","volume-title":"Competitive Markov Decision Processes","author":"J Filar","year":"2012","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Berlin (2012)"},{"key":"1160_CR20","doi-asserted-by":"publisher","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, 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"key":"1160_CR21","unstructured":"Gidel, G., Berard, H., Vignoud, G., Vincent, P., Lacoste-Julien, S.: A variational inequality perspective on generative adversarial networks. In: International Conference on Learning Representations (2018)"},{"key":"1160_CR22","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: Advances in Neural Information Processing Systems, pp. 2672\u20132680 (2014)"},{"key":"1160_CR23","unstructured":"Hsieh, Y.-P., Liu, C., Cevher, V.: Finding mixed Nash equilibria of generative adversarial networks. In: International Conference on Machine Learning, pp. 2810\u20132819. PMLR (2019)"},{"key":"1160_CR24","unstructured":"Huang, F., Gao, S., Pei, J., Huang, H.: Accelerated zeroth-order and first-order momentum methods from mini to minimax optimization. https:\/\/arxiv.org\/pdf\/2008.08170.pdf (2020)"},{"key":"1160_CR25","unstructured":"Jin, C., Netrapalli, P., Jordan, M.: What is local optimality in nonconvex\u2013nonconcave minimax optimization? In International Conference on Machine Learning, pp. 4880\u20134889. PMLR (2020)"},{"key":"1160_CR26","unstructured":"Lin, T., Jin, C., Jordan, M.I.: On gradient descent ascent for nonconvex\u2013concave minimax problems. In: Proceedings of the International Conference on Machine Learning (ICML) (2020)"},{"key":"1160_CR27","unstructured":"Liu, S., Lu, S., Chen, X., Feng, Y., Xu, K., Al-Dujaili, A., Hong, M., Obelilly, U.-M.: Min\u2013max optimization without gradients: convergence and applications to adversarial ml. In: Proceedings of the 37th International Conference on Machine Learning (ICML) (2020)"},{"key":"1160_CR28","unstructured":"Liu, Y., Chen, X., Liu, C., Song, D.: Delving into transferable adversarial examples and black-box attacks. In: International Conference on Representation Learning (2017)"},{"key":"1160_CR29","doi-asserted-by":"crossref","unstructured":"Lu, S., Tsaknakis, I., Hong, M., Chen, Y.: Hybrid block successive approximation for one-sided non-convex min\u2013max problems: algorithms and applications. arXiv preprint arXiv:1902.08294 (2019)","DOI":"10.1109\/TSP.2020.2986363"},{"key":"1160_CR30","unstructured":"Luo, L., Ye, H., Huang, Z., Zhang, T.: Stochastic recursive gradient descent ascent for stochastic nonconvex\u2013strongly-concave minimax problems. In: Advances in Neural Information Processing Systems, vol. 33 (2020)"},{"key":"1160_CR31","unstructured":"Ma, S., Bassily, R., Belkin, M.: The power of interpolation: understanding the effectiveness of SGD in modern over-parametrized learning. In: International Conference on Machine Learning, pp. 3325\u20133334 (2018)"},{"key":"1160_CR32","unstructured":"Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A.: Towards deep learning models resistant to adversarial attacks. In: International Conference on Learning Representations (2017)"},{"key":"1160_CR33","unstructured":"Meng, S.Y., Vaswani, S., Laradji, I.H., Schmidt, M., Lacoste-Julien, S.: Fast and furious convergence: stochastic second order methods under interpolation. In: International Conference on Artificial Intelligence and Statistics, pp. 1375\u20131386 (2020)"},{"key":"1160_CR34","first-page":"1","volume":"179","author":"M Menickelly","year":"2018","unstructured":"Menickelly, M., Wild, S.M.: Derivative-free robust optimization by outer approximations. Math. Program. 179, 1\u201337 (2018)","journal-title":"Math. Program."},{"key":"1160_CR35","doi-asserted-by":"crossref","unstructured":"Mertikopoulos, P., Papadimitriou, C., Piliouras, G.: Cycles in adversarial regularized learning. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2703\u20132717. SIAM (2018)","DOI":"10.1137\/1.9781611975031.172"},{"key":"1160_CR36","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1613\/jair.613","volume":"11","author":"DE Moriarty","year":"1999","unstructured":"Moriarty, D.E., Schultz, A.C., Grefenstette, J.J.: Evolutionary algorithms for reinforcement learning. J. Artif. Intell. Res. 11, 241\u2013276 (1999)","journal-title":"J. Artif. Intell. Res."},{"key":"1160_CR37","unstructured":"Namkoong, H., Duchi, J.C.: Stochastic gradient methods for distributionally robust optimization with f-divergences. In: Advances in Neural Information Processing Systems, pp. 2208\u20132216 (2016)"},{"key":"1160_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course. Applied Optimization","author":"YE Nesterov","year":"2004","unstructured":"Nesterov, Y.E.: Introductory Lectures on Convex Optimization: A Basic Course. Applied Optimization. Kluwer Academic Publishers, Boston (2004)"},{"key":"1160_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-91578-4","volume-title":"Lectures on Convex Optimization","author":"Y Nesterov","year":"2018","unstructured":"Nesterov, Y.: Lectures on Convex Optimization, vol. 137. Springer, Berlin (2018)"},{"issue":"2","key":"1160_CR40","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17(2), 527\u2013566 (2017)","journal-title":"Found. Comput. Math."},{"key":"1160_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-0189-2","volume-title":"Stochastic Games and Applications","author":"A Neyman","year":"2003","unstructured":"Neyman, A., Sorin, S., Sorin, S.: Stochastic Games and Applications, vol. 570. Springer, Berlin (2003)"},{"key":"1160_CR42","unstructured":"Nouiehed, M., Sanjabi, M., Huang, T., Lee, J., Razaviyayn, M.: Solving a class of non-convex min\u2013max games using iterative first order methods. In: Advances in Neural Information Processing Systems, pp. 14905\u201314916 (2019)"},{"key":"1160_CR43","doi-asserted-by":"crossref","unstructured":"Oliehoek, F.A., Savani, R., Gallego, J., van\u00a0der Pol, E., Gro\u00df, R.: Beyond local Nash equilibria for adversarial networks. arXiv preprint arXiv:1806.07268 (2018)","DOI":"10.1007\/978-3-030-31978-6_7"},{"key":"1160_CR44","unstructured":"Pfau, D., Vinyals, O.: Connecting generative adversarial networks and actor-critic methods. arXiv preprint arXiv:1610.01945 (2016)"},{"issue":"1","key":"1160_CR45","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10898-018-0688-0","volume":"73","author":"V Picheny","year":"2019","unstructured":"Picheny, V., Binois, M., Habbal, A.: A Bayesian optimization approach to find Nash equilibria. J. Glob. Optim. 73(1), 171\u2013192 (2019)","journal-title":"J. Glob. Optim."},{"key":"1160_CR46","unstructured":"Piliouras, G., Schulman, L.J.: Learning dynamics and the co-evolution of competing sexual species. In: 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"key":"1160_CR47","unstructured":"Rafique, H., Liu, M., Lin, Q., Yang, T.: Non-convex min\u2013max optimization: provable algorithms and applications in machine learning. arXiv preprint arXiv:1810.02060 (2018)"},{"issue":"3","key":"1160_CR48","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"L Rios","year":"2013","unstructured":"Rios, L., Sahinidis, N.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56(3), 1247\u20131293 (2013)","journal-title":"J. Glob. Optim."},{"key":"1160_CR49","unstructured":"Roy, A., Balasubramanian, K., Ghadimi, S., Mohapatra, P.: Escaping saddle-points faster under interpolation-like conditions. In: Advances in Neural Information Processing Systems (2020)"},{"key":"1160_CR50","unstructured":"Roy, A., Chen, Y., Balasubramanian, K., Mohapatra, P.: Online and bandit algorithms for nonstationary stochastic saddle-point optimization. arXiv preprint arXiv:1912.01698 (2019)"},{"key":"1160_CR51","unstructured":"Salimans, T., Ho, J., Chen, X., Sidor, S., Sutskever, I.: Evolution strategies as a scalable alternative to reinforcement learning. arXiv preprint arXiv:1703.03864 (2017)"},{"key":"1160_CR52","unstructured":"Sanjabi, M., Ba, J., Razaviyayn, M., Lee, J.D.: On the convergence and robustness of training gans with regularized optimal transport. In: Advances in Neural Information Processing Systems, pp. 7091\u20137101 (2018)"},{"key":"1160_CR53","unstructured":"Snoek, J., Larochelle, H., Adams, R.P.: Practical Bayesian optimization of machine learning algorithms. In: Advances in Neural Information Processing Systems, pp. 2951\u20132959 (2012)"},{"key":"1160_CR54","unstructured":"Stein, C.: A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. In: Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, Volume 2: Probability Theory, vol. 6, pp. 583\u2013603. University of California Press (1972)"},{"key":"1160_CR55","unstructured":"Szegedy, C., Zaremba, W., Sutskever, I., Bruna, J., Erhan, D., Goodfellow, I., Fergus, R.: Intriguing properties of neural networks. arXiv preprint arXiv:1312.6199 (2013)"},{"key":"1160_CR56","unstructured":"Thekumparampil, K., Jain, P., Netrapalli, P., Oh, S.: Efficient algorithms for smooth minimax optimization. In: Advances in Neural Information Processing Systems, pp. 12659\u201312670 (2019)"},{"key":"1160_CR57","unstructured":"Vaswani, S., Bach, F., Schmidt, M.: Fast and faster convergence of SGD for over-parameterized models and an accelerated perceptron. In: The 22nd International Conference on Artificial Intelligence and Statistics, pp. 1195\u20131204. PMLR (2019)"},{"key":"1160_CR58","unstructured":"Vaswani, S., Mishkin, A., Laradji, I., Schmidt, M., Gidel, G., Lacoste-Julien, S.: Painless stochastic gradient: interpolation, line-search, and convergence rates. In: Advances in Neural Information Processing Systems, pp. 3727\u20133740 (2019)"},{"key":"1160_CR59","first-page":"10450","volume":"32","author":"E-V Vlatakis-Gkaragkounis","year":"2019","unstructured":"Vlatakis-Gkaragkounis, E.-V., Flokas, L., Piliouras, G.: Poincar\u00e9 recurrence, cycles and spurious equilibria in gradient-descent-ascent for non-convex non-concave zero-sum games. Adv. Neural Inf. Process. Syst. 32, 10450\u201310461 (2019)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1160_CR60","unstructured":"Wang, Z., Jegelka, S.: Max-value entropy search for efficient Bayesian optimization. In: Proceedings of the 34th International Conference on Machine Learning-Volume 70, pp. 3627\u20133635. JMLR.org (2017)"},{"key":"1160_CR61","unstructured":"Wei, C.-Y., Hong, Y.-T., Lu, C.-J.: Online reinforcement learning in stochastic games. In: Advances in Neural Information Processing Systems, pp. 4987\u20134997 (2017)"},{"key":"1160_CR62","doi-asserted-by":"crossref","unstructured":"Xu, D., Yuan, S., Zhang, L., Wu, X.: Fairgan: fairness-aware generative adversarial networks. In: IEEE International Conference on Big Data (Big Data), pp. 570\u2013575. IEEE (2018)","DOI":"10.1109\/BigData.2018.8622525"},{"key":"1160_CR63","unstructured":"Xu, T., Zhe\u00a0Wang, Z., Liang, Y., Poor, H.V.: Gradient free minimax optimization: variance reduction and faster convergence. https:\/\/arxiv.org\/pdf\/2006.09361.pdf (2021)"},{"key":"1160_CR64","unstructured":"Xu, T., Wang, Z., Liang, Y., Vincent Poor, H.: Enhanced first and zeroth order variance reduced algorithms for min\u2013max optimization. arXiv preprint arXiv:2006.09361 (2020)"},{"key":"1160_CR65","unstructured":"Ying, Y., Wen, L., Lyu, S.: Stochastic online AUC maximization. In: Advances in Neural Information Processing Systems, pp. 451\u2013459 (2016)"},{"key":"1160_CR66","doi-asserted-by":"crossref","unstructured":"Zhang, B.H., Lemoine, B., Mitchell, M.: Mitigating unwanted biases with adversarial learning. In: AAAI\/ACM Conference on AI, Ethics, and Society, pp. 335\u2013340. ACM (2018)","DOI":"10.1145\/3278721.3278779"},{"key":"1160_CR67","doi-asserted-by":"crossref","unstructured":"Zhang, K., Yang, Z., Ba\u015far, T.: Multi-agent reinforcement learning: a selective overview of theories and algorithms. In: Handbook of Reinforcement Learning and Control, pp. 321\u2013384 (2021)","DOI":"10.1007\/978-3-030-60990-0_12"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01160-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01160-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01160-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T19:53:37Z","timestamp":1698782017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01160-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,29]]},"references-count":67,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1160"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01160-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,29]]},"assertion":[{"value":"29 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}