{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:11Z","timestamp":1740123971338,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T00:00:00Z","timestamp":1710288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T00:00:00Z","timestamp":1710288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s10957-024-02404-7","type":"journal-article","created":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T08:55:41Z","timestamp":1710320141000},"page":"668-698","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Inexact Cyclic Block Proximal Gradient Method and Properties of Inexact Proximal Maps"],"prefix":"10.1007","volume":"201","author":[{"given":"Leandro","family":"Farias\u00a0Maia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3130-0076","authenticated-orcid":false,"given":"David Huckleberry","family":"Gutman","sequence":"additional","affiliation":[]},{"given":"Ryan Christopher","family":"Hughes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,13]]},"reference":[{"key":"2404_CR1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974997","volume-title":"First-Order Methods in Optimization","author":"A Beck","year":"2017","unstructured":"Beck, A.: First-Order Methods in Optimization. SIAM, Philadelphia (2017)"},{"issue":"4","key":"2404_CR2","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 type methods. SIAM J. Optim. 23(4), 2037\u20132060 (2013). https:\/\/doi.org\/10.1137\/120887679","journal-title":"SIAM J. Optim."},{"issue":"8","key":"2404_CR3","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/j.sigpro.2011.03.003","volume":"91","author":"R Broughton","year":"2011","unstructured":"Broughton, R., Coope, I., Renaud, P., Tappenden, R.: A box constrained gradient projection algorithm for compressed sensing. Signal Process. 91(8), 1985\u20131992 (2011)","journal-title":"Signal Process."},{"issue":"3","key":"2404_CR4","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1137\/060676386","volume":"19","author":"A d\u2019Aspremont","year":"2008","unstructured":"d\u2019Aspremont, A.: Smooth optimization with approximate gradient. SIAM J. Optim. 19(3), 1171\u20131183 (2008)","journal-title":"SIAM J. Optim."},{"key":"2404_CR5","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: Intermediate gradient methods for smooth convex problems with inexact oracle. Technical report CORE-2013017 Center for Operations Research (2013)"},{"issue":"1","key":"2404_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10107-013-0677-5","volume":"146","author":"O Devolder","year":"2014","unstructured":"Devolder, O., Glineur, F., Nesterov, Y.: First-order methods of smooth convex optimization with inexact oracle. Math. Program. 146(1), 37\u201375 (2014)","journal-title":"Math. Program."},{"issue":"4","key":"2404_CR7","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"D Donoho","year":"2006","unstructured":"Donoho, D.: Compressed sensing. IEEE Trans. Inf. Theory 52(4), 1289\u20131306 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"2404_CR8","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10957-016-0999-6","volume":"171","author":"P Dvurechensky","year":"2016","unstructured":"Dvurechensky, P., Gasnikov, A.: Stochastic intermediate gradient method for convex problems with stochastic inexact oracle. J. Optim. Theory Appl. 171(1), 121\u2013145 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"2404_CR9","unstructured":"Frongillo, R., Reid, M.: Convergence analysis of prediction markets via randomized subspace descent. In: Cortes, C., Lawrence, N., Lee, D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"key":"2404_CR10","volume-title":"Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods","author":"J Hiriart-Urruty","year":"2013","unstructured":"Hiriart-Urruty, J., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods. Springer, Berlin (2013)"},{"issue":"1","key":"2404_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-015-0969-z","volume":"160","author":"X Hua","year":"2016","unstructured":"Hua, X., Yamashita, N.: Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization. Math. Program. 160(1), 1\u201332 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"2404_CR12","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1287\/moor.1100.0456","volume":"35","author":"D Leventhal","year":"2010","unstructured":"Leventhal, D., Lewis, A.: Randomized methods for linear constraints: convergence rates and conditioning. Math. Oper. Res. 35(3), 641\u2013654 (2010)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2404_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/16M1099546","volume":"28","author":"H Lu","year":"2018","unstructured":"Lu, H., Freund, R., Nesterov, Y.: Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28(1), 333\u2013354 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2404_CR14","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(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"2404_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s12532-013-0051-x","volume":"5","author":"Z Qin","year":"2013","unstructured":"Qin, Z., Scheinberg, K., Goldfarb, D.: Efficient block-coordinate descent algorithms for the group lasso. Math. Program. Comput. 5(2), 143\u2013169 (2013)","journal-title":"Math. Program. Comput."},{"key":"2404_CR16","doi-asserted-by":"crossref","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Efficient serial and parallel coordinate descent methods for huge-scale truss topology design. In: Klatte, D., L\u00fcthi, H., Schmedders, K. (eds.) Operations Research Proceedings, vol. 2011 (2012)","DOI":"10.1007\/978-3-642-29210-1_5"},{"issue":"1\u20132","key":"2404_CR17","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10107-015-0901-6","volume":"156","author":"P Richt\u00e1rik","year":"2016","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Parallel coordinate descent methods for big data optimization. Math. Program. 156(1\u20132), 433\u2013484 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"2404_CR18","first-page":"1167","volume":"19","author":"S Salzo","year":"2012","unstructured":"Salzo, S., Villa, S.: Inexact and accelerated proximal point algorithms. J. Convex Anal. 19(4), 1167\u20131192 (2012)","journal-title":"J. Convex Anal."},{"key":"2404_CR19","unstructured":"Schmidt, M., Roux, N., Bach, F.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Shawe-Taylor, J., Zemel, R., Bartlett, P., Pereira, F., Weinberger, K. (eds.) Advances in Neural Information Processing Systems, vol. 24 (2011)"},{"issue":"1","key":"2404_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s13675-015-0048-5","volume":"4","author":"R Shefi","year":"2016","unstructured":"Shefi, R., Teboulle, M.: On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems. EURO J. Comput. Optim. 4(1), 27\u201346 (2016)","journal-title":"EURO J. Comput. Optim."},{"issue":"2","key":"2404_CR21","first-page":"983","volume":"22","author":"N Simon","year":"2012","unstructured":"Simon, N., Tibshirani, R.: Standardization and the group lasso penalty. Stat. Sin. 22(2), 983\u20131002 (2012)","journal-title":"Stat. Sin."},{"issue":"1","key":"2404_CR22","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/s10957-016-0867-4","volume":"170","author":"R Tappenden","year":"2016","unstructured":"Tappenden, R., Richt\u00e1rik, P., Gondzio, J.: Inexact coordinate descent: complexity and preconditioning. J. Optim. Theory Appl. 170(1), 144\u2013176 (2016)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"2404_CR23","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1137\/110844805","volume":"23","author":"S Villa","year":"2013","unstructured":"Villa, S., Salzo, S., Baldassarre, L., Verri, A.: Accelerated and inexact forward\u2013backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013)","journal-title":"SIAM J. Optim."},{"issue":"7","key":"2404_CR24","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"S Wright","year":"2009","unstructured":"Wright, S., Nowak, R., Figueiredo, M.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57(7), 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02404-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02404-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02404-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T15:13:44Z","timestamp":1715267624000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02404-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,13]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["2404"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02404-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2024,3,13]]},"assertion":[{"value":"3 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}