{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T13:27:55Z","timestamp":1779197275666,"version":"3.51.4"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T00:00:00Z","timestamp":1651104000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T00:00:00Z","timestamp":1651104000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"funda\u00e7\u00e3o de amparo \u00e0 pesquisa do estado de s\u00e3o paulo","doi-asserted-by":"publisher","award":["2013\/07375-0"],"award-info":[{"award-number":["2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"funda\u00e7\u00e3o de amparo \u00e0 pesquisa do estado de s\u00e3o paulo","doi-asserted-by":"publisher","award":["2016\/01860-1"],"award-info":[{"award-number":["2016\/01860-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"funda\u00e7\u00e3o de amparo \u00e0 pesquisa do estado de s\u00e3o paulo","doi-asserted-by":"publisher","award":["2018\/24293-0"],"award-info":[{"award-number":["2018\/24293-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"conselho nacional de desenvolvimento cient\u00edfico e tecnol\u00f3gico","doi-asserted-by":"publisher","award":["302538\/2019-4"],"award-info":[{"award-number":["302538\/2019-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"conselho nacional de desenvolvimento cient\u00edfico e tecnol\u00f3gico","doi-asserted-by":"publisher","award":["302682\/2019-8"],"award-info":[{"award-number":["302682\/2019-8"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"conselho nacional de desenvolvimento cient\u00edfico e tecnol\u00f3gico","doi-asserted-by":"publisher","award":["306988\/2021-6"],"award-info":[{"award-number":["306988\/2021-6"]}],"id":[{"id":"10.13039\/501100003593","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":[[2022,11]]},"DOI":"10.1007\/s10898-022-01168-6","type":"journal-article","created":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T13:08:16Z","timestamp":1651151296000},"page":"527-561","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization"],"prefix":"10.1007","volume":"84","author":[{"given":"V. S.","family":"Amaral","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Andreani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7466-7663","authenticated-orcid":false,"given":"E. G.","family":"Birgin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. S.","family":"Marcondes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. M.","family":"Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,28]]},"reference":[{"key":"1168_CR1","first-page":"299","volume":"55","author":"FJ Arag\u00f3n Artacho","year":"2014","unstructured":"Arag\u00f3n Artacho, F.J., Borwein, J.M., Tam, M.K.: Douglas\u2013Rachford feasibility methods for matrix completion problems. ANZIAM J. 55, 299\u2013326 (2014)","journal-title":"ANZIAM J."},{"key":"1168_CR2","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"38","author":"H Attouch","year":"2010","unstructured":"Attouch, H., Bolte, J., Redont, P., Soubeyran, A.: Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka\u2013Lojasiewicz inequality. Math. Oper. Res. 38, 438\u2013457 (2010)","journal-title":"Math. Oper. Res."},{"key":"1168_CR3","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent methods. SIAM J. Optim. 23, 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"key":"1168_CR4","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1007\/s11590-019-01395-z","volume":"14","author":"EG Birgin","year":"2020","unstructured":"Birgin, E.G., Gardenghi, J.L., Mart\u00ednez, J.M., Santos, S.A.: On the use of third-order models with fourth-order regularization for unconstrained optimization. Optim. Lett. 14, 815\u2013838 (2020)","journal-title":"Optim. Lett."},{"key":"1168_CR5","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, Ph.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":"1168_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1019928808826","volume":"23","author":"EG Birgin","year":"2002","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl. 23, 101\u2013125 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"1168_CR7","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1137\/17M1127107","volume":"28","author":"EG Birgin","year":"2018","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: On regularization and active-set methods with complexity for constrained optimization. SIAM J. Optim. 28, 1367\u20131395 (2018)","journal-title":"SIAM J. Optim."},{"key":"1168_CR8","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s10589-019-00089-7","volume":"73","author":"EG Birgin","year":"2019","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization. Comput. Optim. Appl. 73, 707\u2013753 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"1168_CR9","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1080\/10556788.2020.1746962","volume":"35","author":"EG Birgin","year":"2020","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Complexity and performance of an augmented Lagrangian algorithm. Optim. Methods Softw. 35, 885\u2013920 (2020)","journal-title":"Optim. Methods Softw."},{"key":"1168_CR10","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10, 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"key":"1168_CR11","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/502800.502803","volume":"27","author":"EG Birgin","year":"2001","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Algorithm 813: SPG\u2014software for convex-constrained optimization. ACM Trans. Math. Softw. 27, 340\u2013349 (2001)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"1168_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v060.i03","volume":"60","author":"EG Birgin","year":"2014","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Spectral projected gradient methods: review and perspectives. J. Stat. Softw. 60(3), 1\u201321 (2014)","journal-title":"J. Stat. Softw."},{"key":"1168_CR13","doi-asserted-by":"publisher","first-page":"3652","DOI":"10.1007\/978-0-387-74759-0_629","volume-title":"Encyclopedia of Optimization","author":"EG Birgin","year":"2008","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Spectral projected gradient methods. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, pp. 3652\u20133659. Springer, Boston (2008)"},{"key":"1168_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization of nonconvex and nonsmooth problems. Math. Program. 146, 1\u201336 (2014)","journal-title":"Math. Program."},{"key":"1168_CR15","first-page":"288","volume":"286","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Prato, M., Begegoldi, S.: A cyclic block coordinate descent method with generalized gradient projections. Appl. Math. Comput. 286, 288\u2013300 (2016)","journal-title":"Appl. Math. Comput."},{"key":"1168_CR16","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1109\/83.491321","volume":"5","author":"CA Bouman","year":"1996","unstructured":"Bouman, C.A., Sauer, K.: A unified approach to statistical tomography using coordinate descent optimization. IEEE Trans. Image Process. 5, 480\u2013492 (1996)","journal-title":"IEEE Trans. Image Process."},{"key":"1168_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3, 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"1168_CR18","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10589-019-00138-1","volume":"75","author":"CP Bras","year":"2020","unstructured":"Bras, C.P., Mart\u00ednez, J.M., Raydan, M.: Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization. Comput. Optim. Appl. 75, 169\u2013205 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"1168_CR19","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1214\/10-AOAS388","volume":"5","author":"P Breheny","year":"2011","unstructured":"Breheny, P., Huang, J.: Coordinate descent algorithms for nonconvex penalized regression with applications to biological feature selection. Ann. Appl. Stat. 5, 232\u2013252 (2011)","journal-title":"Ann. Appl. Stat."},{"key":"1168_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1137\/19M1255355","volume":"31","author":"H Calandra","year":"2021","unstructured":"Calandra, H., Gratton, S., Riccietti, E., Vasseur, X.: On high-order multilevel optimization strategies. SIAM J. Optim. 31, 307\u2013330 (2021)","journal-title":"SIAM J. Optim."},{"key":"1168_CR21","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, Ph.L.: Adaptive cubic regularization methods for unconstrained optimization. Part I: motivation motivation, convergence and numerical results. Math. Program. 127, 245\u2013295 (2011)","journal-title":"Math. Program."},{"key":"1168_CR22","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, Ph.L.: Adaptive cubic regularization methods for unconstrained optimization. Part II: worst-case function and derivative complexity. Math. Program. 130, 295\u2013319 (2011)","journal-title":"Math. Program."},{"key":"1168_CR23","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1137\/16M1106316","volume":"29","author":"C Cartis","year":"2019","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Universal regularization methods\u2014varying the power, the smoothness and the accuracy. SIAM J. Optim. 29, 595\u2013615 (2019)","journal-title":"SIAM J. Optim."},{"key":"1168_CR24","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1007\/s10208-017-9363-y","volume":"18","author":"C Cartis","year":"2018","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Second-order optimality and beyond: characterization and evaluation complexity in convexly-constrained nonlinear optimization. Found. Comput. Math. 18, 1073\u20131107 (2018)","journal-title":"Found. Comput. Math."},{"key":"1168_CR25","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/17M1144854","volume":"30","author":"C Cartis","year":"2020","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints. SIAM J. Optim. 30, 513\u2013541 (2020)","journal-title":"SIAM J. Optim."},{"key":"1168_CR26","unstructured":"Cartis, C., Gould, N.I.M., Toint, Ph.L.: Strong evaluation complexity bounds for arbitrary-order optimization of nonconvex nonsmooth composite functions (2020), arXiv preprint arXiv:2001.10802"},{"key":"1168_CR27","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1110\/ps.0242703","volume":"12","author":"AA Canutescu","year":"2003","unstructured":"Canutescu, A.A., Dunbrack, R.L.: Cyclic coordinate descent: a robotics algorithm for protein loop closure. Protein Sci. 12, 963\u2013972 (2003)","journal-title":"Protein Sci."},{"key":"1168_CR28","volume-title":"Multidimensional Scaling","author":"TF Cox","year":"2001","unstructured":"Cox, T.F., Cox, M.A.A.: Multidimensional Scaling, 2nd edn. Chapman and Hall\/CRC, New York (2001)","edition":"2"},{"key":"1168_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1026-2","volume":"162","author":"FE Curtis","year":"2017","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: A trust-region algorithm with a worst-case iteration complexity of $$O(\\varepsilon ^{-3\/2})$$. Math. Program. 162, 1\u201332 (2017)","journal-title":"Math. Program."},{"key":"1168_CR30","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1080\/10556788.2017.1322080","volume":"33","author":"JP Dussault","year":"2018","unstructured":"Dussault, J.P.: ARCq: a new adaptive regularization by cubics. Optim. Methods Softw. 33, 322\u2013335 (2018)","journal-title":"Optim. Methods Softw."},{"key":"1168_CR31","first-page":"619","volume":"11","author":"J Eckstein","year":"2015","unstructured":"Eckstein, J., Yao, W.: Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives. Pac. J. Optim. 11, 619\u2013644 (2015)","journal-title":"Pac. J. Optim."},{"key":"1168_CR32","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1080\/10556788.2011.643888","volume":"27","author":"H-R Fang","year":"2012","unstructured":"Fang, H.-R., O\u2019Leary, D.P.: Euclidean distance matrix completion problems. Optim. Methods Softw. 27, 695\u2013717 (2012)","journal-title":"Optim. Methods Softw."},{"key":"1168_CR33","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1002\/jcc.540140115","volume":"14","author":"W Glunt","year":"1993","unstructured":"Glunt, W., Hayden, T.L., Raydan, M.: Molecular conformations from distance matrices. J. Comput. Chem. 14, 114\u2013120 (1993)","journal-title":"J. Comput. Chem."},{"key":"1168_CR34","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1137\/16M1087801","volume":"27","author":"GN Grapiglia","year":"2017","unstructured":"Grapiglia, G.N., Nesterov, Y.: Regularized Newton methods for minimizing functions with H\u00f6lder continuous Hessians. SIAM J. Optim. 27, 478\u2013506 (2017)","journal-title":"SIAM J. Optim."},{"key":"1168_CR35","doi-asserted-by":"publisher","first-page":"2750","DOI":"10.1137\/19M1259432","volume":"30","author":"GN Grapiglia","year":"2020","unstructured":"Grapiglia, G.N., Nesterov, Y.: Tensor methods for minimizing functions with H\u00f6lder continuous higher-order derivatives. SIAM J. Optim. 30, 2750\u20132779 (2020)","journal-title":"SIAM J. Optim."},{"key":"1168_CR36","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-014-0794-9","volume":"152","author":"GN Grapiglia","year":"2015","unstructured":"Grapiglia, G.N., Yuan, J.-Y., Yuan, Y.-X.: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Program. 152, 491\u2013520 (2015)","journal-title":"Math. Program."},{"key":"1168_CR37","unstructured":"Griewank, A.: The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms, Technical Report NA\/12. University of Cambridge, Department of Applied Mathematics and Theoretical Physics (1981)"},{"key":"1168_CR38","doi-asserted-by":"publisher","first-page":"2304","DOI":"10.1007\/978-0-387-74759-0_400","volume-title":"Encyclopedia of Optimization","author":"C Lavor","year":"2008","unstructured":"Lavor, C., Liberti, L., Maculan, N.: Molecular distance geometry problem. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, pp. 2304\u20132311. Springer, Boston (2008)"},{"key":"1168_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/120875909","volume":"56","author":"L Liberti","year":"2014","unstructured":"Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean distance geometry and applications. SIAM Rev. 56, 3\u201369 (2014)","journal-title":"SIAM Rev."},{"key":"1168_CR40","doi-asserted-by":"publisher","unstructured":"Lin, T., Jordan, M. I.: A control-theoretic perspective on optimal high-order optimization. Math. Program., to appear https:\/\/doi.org\/10.1007\/s10107-021-01721-3","DOI":"10.1007\/s10107-021-01721-3"},{"key":"1168_CR41","unstructured":"Lin, Q., Lu, Z., Xiao, L.: An accelerated proximal coordinate descent method and its application to empirical risk minimization, arXiv preprint (2014) arXiv:1407.1296"},{"key":"1168_CR42","doi-asserted-by":"publisher","first-page":"2447","DOI":"10.1137\/17M1115472","volume":"27","author":"JM Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, J.M.: On high-order model regularization for constrained optimization. SIAM J. Optim. 27, 2447\u20132458 (2017)","journal-title":"SIAM J. Optim."},{"key":"1168_CR43","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10898-015-0278-3","volume":"63","author":"JM Mart\u00ednez","year":"2015","unstructured":"Mart\u00ednez, J.M., Raydan, M.: Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization. J. Glob. Optim. 63, 315\u2013342 (2015)","journal-title":"J. Glob. Optim."},{"key":"1168_CR44","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10898-016-0475-8","volume":"68","author":"JM Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, J.M., Raydan, M.: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. J. Glob. Optim. 68, 367\u2013385 (2017)","journal-title":"J. Glob. Optim."},{"key":"1168_CR45","first-page":"27","volume":"41","author":"A Mead","year":"1992","unstructured":"Mead, A.: Review of the development of multidimensional scaling methods. J. R. Stat. Soc. Ser. D (Stat.) 41, 27\u201339 (1992)","journal-title":"J. R. Stat. Soc. Ser. D (Stat.)"},{"key":"1168_CR46","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22, 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"key":"1168_CR47","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":"1168_CR48","first-page":"635","volume":"226","author":"MS Petkovi\u0107","year":"2014","unstructured":"Petkovi\u0107, M.S., Neta, B., Petkovi\u0107, L.S., D\u017eunic, J.: Multipoint methods for solving nonlinear equations: a survey. Appl. Math. Comput. 226, 635\u2013660 (2014)","journal-title":"Appl. Math. Comput."},{"key":"1168_CR49","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01584660","volume":"4","author":"MJD Powell","year":"1973","unstructured":"Powell, M.J.D.: On search directions for minimization algorithms. Math. Program. 4, 193\u2013201 (1973)","journal-title":"Math. Program."},{"key":"1168_CR50","volume-title":"Theory & Methods of Scaling","author":"WS Torgerson","year":"1958","unstructured":"Torgerson, W.S.: Theory & Methods of Scaling. Wiley, New York (1958)"},{"key":"1168_CR51","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent methods. Math. Program. 151, 3\u201334 (2015)","journal-title":"Math. Program."},{"key":"1168_CR52","unstructured":"https:\/\/www.rcsb.org. Accessed 14 Aug (2020)"},{"key":"1168_CR53","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/s10915-017-0376-0","volume":"72","author":"Y Xu","year":"2017","unstructured":"Xu, Y., Yin, W.: A globally convergence algorithm for nonconvex optimization based on block coordinate update. J. Sci. Comput. 72, 700\u2013734 (2017)","journal-title":"J. Sci. Comput."},{"key":"1168_CR54","doi-asserted-by":"publisher","first-page":"2400","DOI":"10.1364\/JOSAA.16.002400","volume":"16","author":"JC Yu","year":"1999","unstructured":"Yu, J.C., Webb, K.J., Bouman, C.A., Milane, R.P.: Optical diffusion tomography by iterative coordinate-descent optimization in a Bayesian framework. J. Opt. Soc. Am. A 16, 2400\u20132412 (1999)","journal-title":"J. Opt. Soc. Am. A"},{"key":"1168_CR55","unstructured":"Zhu, X., Han, J., Jiang, B.: An adaptive high-order method for finding third-order critical points of nonconvex optimization, arXiv preprint (2020) arXiv:2008.04191"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01168-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01168-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01168-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T06:10:40Z","timestamp":1666246240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01168-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,28]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1168"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01168-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,28]]},"assertion":[{"value":"4 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}