{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T06:29:59Z","timestamp":1781332199261,"version":"3.54.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T00:00:00Z","timestamp":1603843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T00:00:00Z","timestamp":1603843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["11901561"],"award-info":[{"award-number":["11901561"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004607","name":"Guangxi Natural Science Foundation","doi-asserted-by":"crossref","award":["2018GXNSFBA281180"],"award-info":[{"award-number":["2018GXNSFBA281180"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2019M660833"],"award-info":[{"award-number":["2019M660833"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s11075-020-01017-1","type":"journal-article","created":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T20:02:25Z","timestamp":1603915345000},"page":"1501-1534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization"],"prefix":"10.1007","volume":"87","author":[{"given":"Ting","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zexian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,10,28]]},"reference":[{"key":"1017_CR1","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s11075-013-9718-7","volume":"65","author":"N Andrei","year":"2014","unstructured":"Andrei, N.: An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization. Numer. Algorithm. 65, 859\u2013874 (2014)","journal-title":"Numer. Algorithm."},{"key":"1017_CR2","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1007\/s11590-018-1316-0","volume":"13","author":"C Andrea","year":"2019","unstructured":"Andrea, C., Tayebeh, D.N., Stefano, L.: On global minimizers of quadratic functions with cubic regularization. Optim. Lett. 13, 1269\u20131283 (2019)","journal-title":"Optim. Lett."},{"key":"1017_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai, J., Borwein, J.M.: Two-point step size gradient methods. IMA J. Numer. Anal. 8, 141\u2013148 (1988)","journal-title":"IMA J. Numer. Anal."},{"key":"1017_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/080732432","volume":"48","author":"S Bellavia","year":"2010","unstructured":"Bellavia, S., Morini, B., Cartis, C., Gould, N.I.M., Toint, P.L.: Convergence of a regularized euclidean residual algorithm for nonlinear least-squares. SIAM J. Numer. Anal. 48, 1\u201329 (2010)","journal-title":"SIAM J. Numer. Anal."},{"key":"1017_CR5","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1093\/imanum\/dru021","volume":"35","author":"S Bellavia","year":"2014","unstructured":"Bellavia, S., Morini, B.: Strong local convergence properties of adaptive regularized methods for nonlinear least squares. IMA J. Numer. Anal. 35, 947\u2013968 (2014)","journal-title":"IMA J. Numer. Anal."},{"key":"1017_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10589-013-9626-8","volume":"58","author":"HY Benson","year":"2014","unstructured":"Benson, H.Y., Shanno, D.F.: Interior-point methods for nonconvex nonlinear programming:cubic regularization. Comput. Optim. Appl. 58, 323\u2013346 (2014)","journal-title":"Comput. Optim. Appl."},{"key":"1017_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10589-014-9672-x","volume":"60","author":"T Bianconcini","year":"2015","unstructured":"Bianconcini, T., Liuzzi, G., Morini, B., Sciandrone, M.: On the use of iterative methods in cubic regularization for unconstrained optimization. Comput. Optim. Appl. 60, 35\u201357 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"1017_CR8","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1080\/10556788.2016.1155213","volume":"31","author":"T Bianconcini","year":"2016","unstructured":"Bianconcini, T., Sciandrone, M.: A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques. Optim. Methods Softw. 31, 1008\u20131035 (2016)","journal-title":"Optim. Methods Softw."},{"key":"1017_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-016-1065-8","volume":"163","author":"EG Birgin","year":"2017","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, J. M., Santos, S.A., Toint, P.L.: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math. Program. 163, 359\u2013368 (2017)","journal-title":"Math. Program."},{"key":"1017_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part i: motivation, convergence and numerical results. Math. Program. 127, 245\u2013295 (2011)","journal-title":"Math. Program."},{"key":"1017_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function-and derivative-evaluation complexity. Math. Program. 130, 295\u2013319 (2011)","journal-title":"Math. Program."},{"key":"1017_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s002450010019","volume":"43","author":"YH Dai","year":"2001","unstructured":"Dai, Y.H., Liao, L.Z.: New conjugacy conditions and related nonlinear conjugate gradient methods. Appl. Math. Optim. 43, 87\u2013101 (2001)","journal-title":"Appl. Math. Optim."},{"key":"1017_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"YH Dai","year":"1999","unstructured":"Dai, Y.H., Yuan, Y.: A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10, 177\u2013182 (1999)","journal-title":"SIAM J. Optim."},{"key":"1017_CR14","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/100813026","volume":"23","author":"YH Dai","year":"2013","unstructured":"Dai, Y.H., Kou, C.X.: A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search. SIAM J. Optim. 23, 296\u2013320 (2013)","journal-title":"SIAM J. Optim."},{"key":"1017_CR15","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1007\/s11425-016-0279-2","volume":"59","author":"YH Dai","year":"2016","unstructured":"Dai, Y.H., Kou, C.X.: A Barzilai-Borwein conjugate gradient method. Sci. China Math. 59, 1511\u20131524 (2016)","journal-title":"Sci. China Math."},{"key":"1017_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"1017_CR17","unstructured":"Dussault, J.P.: Simple Unified Convergence Proofs for the Trust-Region and a New ARC variant.Tech. Rep., University of Sherbrooke, Sherbrooke, Canada (2015)"},{"key":"1017_CR18","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.cam.2015.12.035","volume":"300","author":"M Fatemi","year":"2016","unstructured":"Fatemi, M.: A new efficient conjugate gradient method for unconstrained optimization. J. Comput. Appl. Math. 300, 207\u2013216 (2016)","journal-title":"J. Comput. Appl. Math."},{"key":"1017_CR19","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"R Fletcher","year":"1964","unstructured":"Fletcher, R., Reeves, C.M.: Function minimization by conjugate gradients. Comput. J. 7, 149\u2013154 (1964)","journal-title":"Comput. J."},{"key":"1017_CR20","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"NIM Gould","year":"2003","unstructured":"Gould, N.I.M., Orban, D.: CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29, 373\u2013394 (2003)","journal-title":"ACM Trans. Math. Softw."},{"key":"1017_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-011-9446-7","volume":"53","author":"NIM Gould","year":"2012","unstructured":"Gould, N.I.M., Porcelli, M.: Updating the regularization parameter in the adaptive cubic regularization algorithm. Comput. Optim. Appl. 53, 1\u201322 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"1017_CR22","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s12532-010-0011-7","volume":"2","author":"NIM Gould","year":"2010","unstructured":"Gould, N.I.M., Robinson, D.P., Thorne, H.S.: On solving trust-region and other regularised subproblems in optimization. Math. Program. Comput. 2, 21\u201357 (2010)","journal-title":"Math. Program. Comput."},{"key":"1017_CR23","unstructured":"Griewank, A.: The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms. Technical Report NA\/12, Department of Applied Mathematics and Theoretical Physics University of Cambridge (1981)"},{"key":"1017_CR24","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/030601880","volume":"16","author":"WW Hager","year":"2005","unstructured":"Hager, W.W., Zhang, H.: A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM J. Optim. 16, 170\u2013192 (2005)","journal-title":"SIAM J. Optim."},{"key":"1017_CR25","first-page":"35","volume":"2","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2, 35\u201358 (2006)","journal-title":"Pac. J. Optim."},{"key":"1017_CR26","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.1137\/120898097","volume":"23","author":"WW Hager","year":"2013","unstructured":"Hager, W.W., Zhang, H.: The limited memory conjugate gradient method. SIAM J. Optim. 23, 2150\u20132168 (2013)","journal-title":"SIAM J. Optim."},{"key":"1017_CR27","doi-asserted-by":"publisher","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"MR Hestenes","year":"1952","unstructured":"Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear system. J. Res. Natl. Bur. Stand. 49, 409\u2013436 (1952)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"1017_CR28","first-page":"48","volume":"16","author":"LB Li","year":"2007","unstructured":"Li, L.B.: A new algorithm for solving large scale trust region subproblem. Oper. Res. Manag. Sci. 16, 48\u201352 (2007)","journal-title":"Oper. Res. Manag. Sci."},{"key":"1017_CR29","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11075-017-0434-6","volume":"79","author":"M Li","year":"2018","unstructured":"Li, M., Liu, H.W., Liu, Z.X.: A new subspace minimization conjugate gradient method with non- monotone line search for unconstrained optimization. Numer. Algorithms. 79, 195\u2013219 (2018)","journal-title":"Numer. Algorithms."},{"key":"1017_CR30","doi-asserted-by":"crossref","unstructured":"Li, Y.F., Liu, Z.X., Liu, H.W.: A subspace minimization conjugate gradient method based on conic model for unconstrained optimization. Comput. Appl. Math. 38 (2019)","DOI":"10.1007\/s40314-019-0779-7"},{"key":"1017_CR31","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s10957-018-1393-3","volume":"180","author":"HW Liu","year":"2019","unstructured":"Liu, H.W., Liu, Z.X.: An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization. J. Optim. Theory Appl. 180, 879\u2013906 (2019)","journal-title":"J. Optim. Theory Appl."},{"key":"1017_CR32","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.cam.2017.07.035","volume":"328","author":"ZX Liu","year":"2018","unstructured":"Liu, Z.X., Liu, H.W.: Several efficient gradient methods with approximate optimal stepsizes for large scale unconstrained optimization. J. Comput. Appl. Math. 328, 400\u2013413 (2018)","journal-title":"J. Comput. Appl. Math."},{"key":"1017_CR33","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11075-017-0365-2","volume":"78","author":"ZX Liu","year":"2018","unstructured":"Liu, Z.X., Liu, H.W.: An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization. Numer. Algorithms. 78, 21\u201339 (2018)","journal-title":"Numer. Algorithms."},{"key":"1017_CR34","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","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, 503\u2013528 (1989)","journal-title":"Math. Program."},{"key":"1017_CR35","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2018","unstructured":"Necoara, I., Nesterov, Y. u., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program., Ser. A. 175, 69\u2013107 (2018)","journal-title":"Math. Program., Ser. A."},{"key":"1017_CR36","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton\u2019s method and its global performance. Math. Program. 108, 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"1017_CR37","unstructured":"Nathan, C., Autar, K., Jai, P., Michael, K.: Newton-Raphson Method-Graphical Simulation of the Method. University of South Florida. http:\/\/numericalmethods.eng.usf.deu\/mws (2003)"},{"key":"1017_CR38","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10107-006-0089-x","volume":"112","author":"Y Nesterov","year":"2008","unstructured":"Nesterov, Y.: Accelerating the cubic regularization of Newtons method on convex problems. Math. Program. 112, 159\u2013181 (2008)","journal-title":"Math. Program."},{"key":"1017_CR39","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extreme problems. USSR Comput. Math. Math. Phys. 9, 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"1017_CR40","volume-title":"Conjugate Gradient Algorithms in Nonconvex Optimization","author":"P Radosaw","year":"2009","unstructured":"Radosaw, P.: Conjugate Gradient Algorithms in Nonconvex Optimization. Springer, Berlin (2009)"},{"key":"1017_CR41","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1016\/j.amc.2015.07.019","volume":"268","author":"M Rivaie","year":"2015","unstructured":"Rivaie, M., Mamat, M., Abashar, A.: A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches. Appl. Math. Comput. 268, 1152\u20131163 (2015)","journal-title":"Appl. Math. Comput."},{"key":"1017_CR42","first-page":"43","volume":"13","author":"WY Sun","year":"1996","unstructured":"Sun, W.Y.: On nonquadratic model optimization methods. Asia Pac. J. Oper. Res. 13, 43\u201363 (1996)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"1017_CR43","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1080\/10556780600605129","volume":"22","author":"M Weiser","year":"2007","unstructured":"Weiser, M., Deuflhard, P., Erdmann, B.: Affine conjugate adaptive Newton methods for nonlinear elastomechanics. Optim. Methods Softw. 22, 413\u2013431 (2007)","journal-title":"Optim. Methods Softw."},{"key":"1017_CR44","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s11075-017-0284-2","volume":"76","author":"YT Yang","year":"2017","unstructured":"Yang, Y.T., Chen, Y.T., Lu, Y.L.: A subspace conjugate gradient algorithm for largescale unconstrained optimization. Numer. Algorithm. 76, 813\u2013828 (2017)","journal-title":"Numer. Algorithm."},{"key":"1017_CR45","doi-asserted-by":"crossref","unstructured":"Hsia, Y., Sheu, R.L., Yuan, Y.X.: Theory and application of p-regularized subproblems for p >\u20092. Optim Methods Softw. 1059\u20131077 (2017)","DOI":"10.1080\/10556788.2016.1238917"},{"key":"1017_CR46","volume-title":"Optimization Theory and Methods","author":"YX Yuan","year":"1997","unstructured":"Yuan, Y.X., Sun, W.Y.: Optimization Theory and Methods. Science Press, Beijing (1997)"},{"key":"1017_CR47","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/zamm.19950750118","volume":"75","author":"YX Yuan","year":"1995","unstructured":"Yuan, Y.X., Stoer, J.: A subspace study on conjugate gradient algorithms. Z. Angew. Math. Mech. 75, 69\u201377 (1995)","journal-title":"Z. Angew. Math. Mech."},{"key":"1017_CR48","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1093\/imanum\/11.3.325","volume":"11","author":"YX Yuan","year":"1991","unstructured":"Yuan, Y.X.: A modified BFGS algorithm for unconstrained optimization. IMA J. Numer. Anal. 11, 325\u2013332 (1991)","journal-title":"IMA J. Numer. Anal."},{"key":"1017_CR49","unstructured":"Yuan, Y.X.: A review on subspace methods for nonlinear optimization. In: Proceedings of the International Congress of Mathematics 2014, Seoul, Korea, pp 807\u2013827 (2014)"},{"key":"1017_CR50","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11081-008-9064-0","volume":"10","author":"YX Yuan","year":"2009","unstructured":"Yuan, Y.X.: Subspace methods for large scale nonlinear equations and nonlinear least squares. Optim. Eng. 10, 207\u2013218 (2009)","journal-title":"Optim. Eng."},{"key":"1017_CR51","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H., Hager, W.W.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14, 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"key":"1017_CR52","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10589-006-6446-0","volume":"35","author":"B Zhou","year":"2006","unstructured":"Zhou, B., Gao, L., Dai, Y.H.: Gradient methods with adaptive stepsizes. Comput. Optim. Appl. 35, 69\u201386 (2006)","journal-title":"Comput. Optim. Appl."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-01017-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-01017-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-01017-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T04:42:55Z","timestamp":1698295375000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-01017-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,28]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["1017"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-01017-1","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,28]]},"assertion":[{"value":"4 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}