{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T05:07:49Z","timestamp":1778821669142,"version":"3.51.4"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute of Information & Communications Technology Planning & Evaluation","doi-asserted-by":"publisher","award":["RS-2023-00229524"],"award-info":[{"award-number":["RS-2023-00229524"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014188","name":"Ministry of Science and ICT, South Korea","doi-asserted-by":"publisher","award":["RS-2024-00336077"],"award-info":[{"award-number":["RS-2024-00336077"]}],"id":[{"id":"10.13039\/501100014188","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2024-00447720"],"award-info":[{"award-number":["RS-2024-00447720"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2022-NR069691"],"award-info":[{"award-number":["RS-2022-NR069691"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.cam.2026.117642","type":"journal-article","created":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T23:15:28Z","timestamp":1775690128000},"page":"117642","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Asynchronous block coordinate gradient method with the communication noise"],"prefix":"10.1016","volume":"486","author":[{"given":"Woocheol","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jongkyu","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5782-7266","authenticated-orcid":false,"given":"Sangwoon","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117642_bib0001","series-title":"2015 IEEE International Conference on Computer Vision (ICCV)","first-page":"864","article-title":"Global structure-from-motion by similarity averaging","author":"Cui","year":"2015"},{"key":"10.1016\/j.cam.2026.117642_bib0002","series-title":"2018 IEEE\/CVF Conference on Computer Vision and Pattern Recognition","first-page":"4568","article-title":"Very large-scale global sfm by distributed motion averaging","author":"Zhu","year":"2018"},{"key":"10.1016\/j.cam.2026.117642_bib0003","series-title":"2019 International Conference on Robotics and Automation (ICRA)","first-page":"2385","article-title":"Visual SLAM: why bundle adjust?","author":"Bustos","year":"2019"},{"key":"10.1016\/j.cam.2026.117642_bib0004","series-title":"2021 IEEE\/CVF Conference on Computer Vision and Pattern Recognition (CVPR)","first-page":"10353","article-title":"Hybrid rotation averaging: a fast and robust rotation averaging approach","author":"Chen","year":"2021"},{"issue":"6","key":"10.1016\/j.cam.2026.117642_bib0005","doi-asserted-by":"crossref","first-page":"2137","DOI":"10.1109\/TRO.2021.3072346","article-title":"Distributed certifiably correct pose-graph optimization","volume":"37","author":"Tian","year":"2021","journal-title":"IEEE Trans. Rob."},{"issue":"4","key":"10.1016\/j.cam.2026.117642_bib0006","doi-asserted-by":"crossref","first-page":"5819","DOI":"10.1109\/LRA.2020.3010216","article-title":"Asynchronous and parallel distributed pose graph optimization","volume":"5","author":"Tian","year":"2020","journal-title":"IEEE Rob. Autom. Lett."},{"issue":"8","key":"10.1016\/j.cam.2026.117642_bib0007","doi-asserted-by":"crossref","first-page":"4674","DOI":"10.1021\/acs.jctc.2c00218","article-title":"Quantum orbital minimization method for excited states calculation on a quantum computer","volume":"18","author":"Bierman","year":"2022","journal-title":"J. Chem. Theory Comput."},{"key":"10.1016\/j.cam.2026.117642_bib0008","unstructured":"H.-J. M. Shi, S. Tu, Y. Xu, W. Yin, A primer on coordinate descent algorithms, 2017, 1610.00040."},{"key":"10.1016\/j.cam.2026.117642_bib0009","unstructured":"L. Peng, R. Vidal, Block coordinate descent on smooth manifolds: convergence theory and twenty-one examples, 2023, 2305.14744."},{"issue":"1","key":"10.1016\/j.cam.2026.117642_bib0010","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","article-title":"Coordinate descent algorithms","volume":"151","author":"Wright","year":"2015","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cam.2026.117642_bib0011","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01584660","article-title":"On search directions for minimization algorithms","volume":"4","author":"Powell","year":"1973","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cam.2026.117642_bib0012","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","article-title":"A coordinate gradient descent method for nonsmooth separable minimization","volume":"117","author":"Tseng","year":"2009","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cam.2026.117642_bib0013","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10107-019-01374-3","article-title":"First-order methods almost always avoid strict saddle points","volume":"176","author":"Lee","year":"2019","journal-title":"Math. Program."},{"issue":"2","key":"10.1016\/j.cam.2026.117642_bib0014","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/21M1460375","article-title":"On the global convergence of randomized coordinate gradient descent for nonconvex optimization","volume":"33","author":"Chen","year":"2023","journal-title":"SIAM J. Optim."},{"issue":"4","key":"10.1016\/j.cam.2026.117642_bib0015","doi-asserted-by":"crossref","first-page":"A2681","DOI":"10.1137\/18M1202505","article-title":"CoordinateWise descent methods for leading eigenvalue problem","volume":"41","author":"Li","year":"2019","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.cam.2026.117642_bib0016","series-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems","article-title":"Asynchronous coordinate descent under more realistic assumption","author":"Sun","year":"2017"},{"key":"10.1016\/j.cam.2026.117642_bib0017","series-title":"Proceedings of the 40th International Conference on Machine Learning","first-page":"37582","article-title":"Delay-agnostic asynchronous coordinate update algorithm","author":"Wu","year":"2023"},{"issue":"1","key":"10.1016\/j.cam.2026.117642_bib0018","doi-asserted-by":"crossref","DOI":"10.1007\/s10589-023-00489-w","article-title":"Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization","volume":"86","author":"Traor\u00e9","year":"2023","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"10.1016\/j.cam.2026.117642_bib0019","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02096261","article-title":"Error bounds and convergence analysis of feasible descent methods: a general approach","volume":"46","author":"Luo","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cam.2026.117642_bib0020","series-title":"Optimization Algorithms on Matrix Manifolds","author":"Absil","year":"2008"},{"issue":"11","key":"10.1016\/j.cam.2026.117642_bib0021","doi-asserted-by":"crossref","first-page":"7610","DOI":"10.1109\/TPAMI.2021.3112139","article-title":"Improved variance reduction methods for Riemannian non-convex optimization","volume":"44","author":"Han","year":"2022","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.cam.2026.117642_bib0022","series-title":"Proceedings of the 30th International Conference on Neural Information Processing Systems","first-page":"45994607","article-title":"Riemannian SVRG: fast stochastic optimization on Riemannian manifolds","author":"Zhang","year":"2016"},{"key":"10.1016\/j.cam.2026.117642_bib0023","series-title":"Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48","first-page":"11581167","article-title":"Quadratic optimization with orthogonality constraints: explicit \u0141ojasiewicz exponent and linear convergence of line-search methods","author":"Liu","year":"2016"},{"issue":"3","key":"10.1016\/j.cam.2026.117642_bib0024","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1007\/s11228-022-00634-3","article-title":"Stability of minimization problems and the error bound condition","volume":"30","author":"Balashov","year":"2022","journal-title":"Set-Valued Var. Anal."},{"issue":"1","key":"10.1016\/j.cam.2026.117642_bib0025","first-page":"4","article-title":"The Lezanski Polyak Lojasiewicz inequality and the convergence of the gradient projection algorithm","volume":"23","author":"Balashov","year":"2023","journal-title":"Izvestiya Saratov Univ. Math. Mech. Inf."},{"issue":"3","key":"10.1016\/j.cam.2026.117642_bib0026","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1080\/02331934.2020.1812066","article-title":"Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds","volume":"71","author":"Balashov","year":"2022","journal-title":"Optimization"},{"issue":"06","key":"10.1016\/j.cam.2026.117642_bib0027","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1142\/S0219530524500106","article-title":"Non-ergodic linear convergence property of the delayed gradient descent under the strongly convexity and the Polyak-\u0141ojasiewicz condition","volume":"22","author":"Choi","year":"2024","journal-title":"Anal. Appl."},{"issue":"1","key":"10.1016\/j.cam.2026.117642_bib0028","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/18M122457X","article-title":"Proximal gradient method for nonsmooth optimization over the Stiefel manifold","volume":"30","author":"Chen","year":"2020","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117642_bib0029","series-title":"Matrix Computations - 4th Edition","author":"Golub","year":"2013"}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726002852?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726002852?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:14:12Z","timestamp":1778818452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726002852"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":29,"alternative-id":["S0377042726002852"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117642","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Asynchronous block coordinate gradient method with the communication noise","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117642","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"117642"}}