{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T18:23:27Z","timestamp":1776363807645,"version":"3.51.2"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:00:00Z","timestamp":1657324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:00:00Z","timestamp":1657324800000},"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"],"award-info":[{"award-number":["302538\/2019"]}],"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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10589-022-00389-5","type":"journal-article","created":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T08:03:07Z","timestamp":1657353787000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Block coordinate descent for smooth nonconvex constrained minimization"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7466-7663","authenticated-orcid":false,"given":"E. G.","family":"Birgin","sequence":"first","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,7,9]]},"reference":[{"key":"389_CR1","doi-asserted-by":"crossref","unstructured":"Aarts, E., Lenstra, J. K., (eds.): Local search in combinatorial optimization, Princeton University Press, (2003)","DOI":"10.1515\/9780691187563"},{"key":"389_CR2","doi-asserted-by":"publisher","unstructured":"Amaral, V.A., Andreani, R., Birgin, E.G., Marcondes, D.S., Mart\u00ednez, J.M.: On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization. J. Glob. Optim. https:\/\/doi.org\/10.1007\/s10898-022-0.1168-6 (to appear)","DOI":"10.1007\/s10898-022-0.1168-6"},{"key":"389_CR3","unstructured":"Applegate, D. L., Bixby, R. E., Chv\u00e1tal, V., Cook, W. J.: The traveling salesman problem: a computational study, Princeton University Press, (2006)"},{"key":"389_CR4","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. Mathematical Programming 163, 359\u2013368 (2017)","journal-title":"Mathematical Programming"},{"key":"389_CR5","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 Journal on Optimization 28, 1367\u20131395 (2018)","journal-title":"SIAM Journal on Optimization"},{"key":"389_CR6","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. Computational Optimization and Applications 73, 707\u2013753 (2019)","journal-title":"Computational Optimization and Applications"},{"key":"389_CR7","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.amc.2016.04.031","volume":"286","author":"S Bonettini","year":"2016","unstructured":"Bonettini, S., Prato, M., Begegoldi, S.: A cyclic block coordinate descent method with generalized gradient projections. Applied Mathematics and Computation 286, 288\u2013300 (2016)","journal-title":"Applied Mathematics and Computation"},{"key":"389_CR8","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New insertion and post optimization procedures for the traveling salesman problem. Operations Research 40, 1086\u20131094 (1992)","journal-title":"Operations Research"},{"key":"389_CR9","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York, NY (2006)"},{"key":"389_CR10","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. Mathematical Programming 4, 193\u2013201 (1973)","journal-title":"Mathematical Programming"},{"key":"389_CR11","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. Mathematical Programming 151, 3\u201334 (2015)","journal-title":"Mathematical Programming"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00389-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00389-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00389-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,5]],"date-time":"2022-08-05T06:17:33Z","timestamp":1659680253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00389-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,9]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["389"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00389-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,9]]},"assertion":[{"value":"26 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}