{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,22]],"date-time":"2026-09-22T16:17:33Z","timestamp":1790093853744,"version":"4.0.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T00:00:00Z","timestamp":1675641600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T00:00:00Z","timestamp":1675641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["Grant No. 1839286"],"award-info":[{"award-number":["Grant No. 1839286"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10915-023-02101-z","type":"journal-article","created":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T02:02:47Z","timestamp":1675648967000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Linearly-Convergent FISTA Variant for Composite Optimization with Duality"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1581-570X","authenticated-orcid":false,"given":"Casey","family":"Garner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5838-1676","authenticated-orcid":false,"given":"Shuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,6]]},"reference":[{"issue":"1","key":"2101_CR1","first-page":"8194","volume":"18","author":"Z Allen-Zhu","year":"2017","unstructured":"Allen-Zhu, Z.: Katyusha: the first direct acceleration of stochastic gradient methods. J. Mach. Learn. Res. 18(1), 8194\u20138244 (2017)","journal-title":"J. Mach. Learn. Res."},{"key":"2101_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF00940050","volume":"73","author":"A Auslender","year":"1992","unstructured":"Auslender, A.: Asymptotic properties of the Fenchel\u2019s dual functional and their applications to decomposition problems. J. Optim. Theory Appl. 73, 427\u2013449 (1992). https:\/\/doi.org\/10.1007\/BF00940050","journal-title":"J. Optim. Theory Appl."},{"key":"2101_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1069-4","volume":"164","author":"A Beck","year":"2017","unstructured":"Beck, A., Shtern, S.: Linearly convergent away-step conditional gradient for non-strongly convex functions. Math. Program. 164, 1\u201327 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1069-4","journal-title":"Math. Program."},{"key":"2101_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-threshold algorithm linear inverse problems. SIAM J. Imaging Sci. 2, 183\u2013202 (2009). https:\/\/doi.org\/10.1137\/080716542","journal-title":"SIAM J. Imaging Sci."},{"key":"2101_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s11081-007-9001-7","volume":"8","author":"S Boyd","year":"2007","unstructured":"Boyd, S., Kim, S., Vandenberghe, L., Hassibi, A.: A tutorial on geometric programming. Optim. Eng. 8, 67\u2013127 (2007). https:\/\/doi.org\/10.1007\/s11081-007-9001-7","journal-title":"Optim. Eng."},{"key":"2101_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01585997","volume":"71","author":"JV Burke","year":"1995","unstructured":"Burke, J.V., Ferris, M.C.: A gauss-newton method for convex composite optimization. Math. Program. 71, 179\u2013194 (1995). https:\/\/doi.org\/10.1007\/BF01585997","journal-title":"Math. Program."},{"key":"2101_CR7","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1137\/17M1149390","volume":"29","author":"L Calatroni","year":"2019","unstructured":"Calatroni, L., Chambolle, A.: Backtracking strategies for accelerated descent methods with smooth composite objectives. SIAM J. Optim. 29, 1772\u20131798 (2019). https:\/\/doi.org\/10.1137\/17M1149390","journal-title":"SIAM J. Optim."},{"key":"2101_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numer. 25, 161\u2013319 (2016)","journal-title":"Acta Numer."},{"key":"2101_CR9","doi-asserted-by":"crossref","unstructured":"d\u2019Aspremont, A., Scieur, D., Taylor, A.: Acceleration methods (2021). arXiv:2101.09545v1","DOI":"10.1561\/9781680839296"},{"key":"2101_CR10","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1287\/moor.2017.0889","volume":"43","author":"D Drusvyatskiy","year":"2018","unstructured":"Drusvyatskiy, D., Lewis, A.S.: Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Oper. Res. 43, 919\u2013948 (2018). https:\/\/doi.org\/10.1287\/moor.2017.0889","journal-title":"Math. Oper. Res."},{"key":"2101_CR11","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10107-018-1311-3","volume":"178","author":"D Drusvyatskiy","year":"2019","unstructured":"Drusvyatskiy, D., Paquette, C.: Efficiency of minimizing compositions of convex functions and smooth maps. Math. Program. 178, 503\u2013558 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1311-3","journal-title":"Math. Program."},{"key":"2101_CR12","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1109\/TSP.2018.2866409","volume":"67","author":"MI Florea","year":"2019","unstructured":"Florea, M.I., Vorobyov, S.A.: An accelerated composite gradient method for large-scale composite objective problems. IEEE Trans. Signal Process. 67, 444\u2013459 (2019). https:\/\/doi.org\/10.1109\/TSP.2018.2866409","journal-title":"IEEE Trans. Signal Process."},{"key":"2101_CR13","doi-asserted-by":"publisher","first-page":"3033","DOI":"10.1109\/TSP.2020.2988614","volume":"68","author":"MI Florea","year":"2020","unstructured":"Florea, M.I., Vorobyov, S.A.: A generalized accelerated composite gradient method: uniting Nesterov\u2019s fast gradient method and Fista. IEEE Trans. Signal Process. 68, 3033\u20133048 (2020). https:\/\/doi.org\/10.1109\/TSP.2020.2988614","journal-title":"IEEE Trans. Signal Process."},{"key":"2101_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF00429749","volume":"5","author":"M Fukushima","year":"1996","unstructured":"Fukushima, M., Haddou, M., Nguyen, H.V., Strodiot, J.J., Sugimoto, T., Yamakawa, E.: A parallel descent algorithm for convex programming. Comput. Optim. Appl. 5, 5\u201337 (1996). https:\/\/doi.org\/10.1007\/BF00429749","journal-title":"Comput. Optim. Appl."},{"key":"2101_CR15","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02614077","volume":"36","author":"N Gaffke","year":"1989","unstructured":"Gaffke, N., Mathar, R.: A cyclic projection algorithm via duality. Metrika 36, 29\u201354 (1989). https:\/\/doi.org\/10.1007\/BF02614077","journal-title":"Metrika"},{"key":"2101_CR16","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/0326019","volume":"26","author":"SP Han","year":"1988","unstructured":"Han, S.P., Lou, G.: A parallel algorithm for a class of convex programs. SIAM J. Control Optim. 26, 345\u2013355 (1988). https:\/\/doi.org\/10.1137\/0326019","journal-title":"SIAM J. Control Optim."},{"key":"2101_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10107-016-1034-2","volume":"162","author":"M Hong","year":"2017","unstructured":"Hong, M., Luo, Z.Q.: On the linear convergence of the alternating direction method of multipliers. Math. Program. 162, 165\u2013199 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1034-2","journal-title":"Math. Program."},{"key":"2101_CR18","doi-asserted-by":"publisher","unstructured":"Jacob, L., Obozinski, G., Vert, J.P.: Group lasso with overlap and graph lasso. In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML \u201909, p. 433-440. Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1553374.1553431","DOI":"10.1145\/1553374.1553431"},{"key":"2101_CR19","unstructured":"Liu, J., Ji, S., Ye, J.: SLEP: Sparse Learning with Efficient Projections. Arizona State University (2009). http:\/\/yelabs.net\/software\/SLEP\/"},{"key":"2101_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1111\/j.1467-9868.2007.00627.x","volume":"70","author":"L Meier","year":"2008","unstructured":"Meier, L., Geer, S., Buhlmann, P.: The group lasso for logistic regression. J. R. Stat. Soc. Ser. B. Stat. Methodol. 70, 53\u201371 (2008)","journal-title":"J. R. Stat. Soc. Ser. B. Stat. Methodol."},{"key":"2101_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-018-1232-1","volume":"175","author":"I Necoara","year":"2019","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Linear convergence of first order methods for non-strongly convex optimization. Math. Program. 175, 69\u2013107 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1232-1","journal-title":"Math. Program."},{"key":"2101_CR22","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for solving the convex programming problem with convergence rate $$o(1\/k^2)$$. Proc. USSR Acad. Sci. 269, 543\u2013547 (1983)","journal-title":"Proc. USSR Acad. Sci."},{"key":"2101_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140, 125\u2013161 (2013). https:\/\/doi.org\/10.1007\/s10107-012-0629-5","journal-title":"Math. Program."},{"key":"2101_CR24","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, 143\u2013169 (2013). https:\/\/doi.org\/10.1007\/s12532-013-0051-x","journal-title":"Math. Program. Comput."},{"key":"2101_CR25","doi-asserted-by":"crossref","unstructured":"Rebegoldi, S., Calatroni, L.: Scaled, inexact and adaptive generalized fista for strongly convex optimization (2021). arXiv:2101.03915","DOI":"10.1137\/21M1391699"},{"key":"2101_CR26","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis, 2nd edn. Princeton University Press, Princeton (1970)","edition":"2"},{"key":"2101_CR27","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/ijoo.2019.0034","volume":"2","author":"K Roos","year":"2020","unstructured":"Roos, K., Balvert, M., Gorissen, B.L., den Hertog, D.: A universal and structured way to derive dual optimization problem formulations. INFORMS J. Optim. 2, 229\u2013255 (2020). https:\/\/doi.org\/10.1287\/ijoo.2019.0034","journal-title":"INFORMS J. Optim."},{"key":"2101_CR28","unstructured":"Shi, H.J.M., Tu, S., Xu, Y., Yin, W.: A primer on coordinate descent algorithms. arXiv preprint arXiv:1610.00040 (2016)"},{"key":"2101_CR29","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1080\/10618600.2012.681250","volume":"22","author":"N Simon","year":"2013","unstructured":"Simon, N., Friedman, J., Hastie, T., Tibshirani, R.: A sparse-group lasso. J. Comput. Graph. Stat. 22, 231\u2013245 (2013). https:\/\/doi.org\/10.1080\/10618600.2012.681250","journal-title":"J. Comput. Graph. Stat."},{"key":"2101_CR30","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B. Stat. Methodol. 58, 267\u2013288 (1996). https:\/\/doi.org\/10.1111\/j.2517-6161.1996.tb02080.x","journal-title":"J. R. Stat. Soc. Ser. B. Stat. Methodol."},{"key":"2101_CR31","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1093\/imanum\/10.3.299","volume":"10","author":"SJ Wright","year":"1990","unstructured":"Wright, S.J.: Convergence of an inexact algorithm for composite nonsmooth optimization. IMA J. Numer. Anal. 10, 299\u2013321 (1990). https:\/\/doi.org\/10.1093\/imanum\/10.3.299","journal-title":"IMA J. Numer. Anal."},{"issue":"4","key":"2101_CR32","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1287\/ijoo.2021.0055","volume":"3","author":"Y Xu","year":"2021","unstructured":"Xu, Y., Xu, Y.: Katyusha acceleration for convex finite-sum compositional optimization. INFORMS J. Optim. 3(4), 418\u2013443 (2021)","journal-title":"INFORMS J. Optim."},{"key":"2101_CR33","doi-asserted-by":"publisher","unstructured":"Yuan, L., Liu, J., Ye, J.: Efficient methods for overlapping group lasso. IEEE Trans. Pattern Anal. Mach. Intell. 35, 2104\u20132116 (2013). https:\/\/doi.org\/10.1109\/TPAMI.2013.17","DOI":"10.1109\/TPAMI.2013.17"},{"key":"2101_CR34","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2007","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. Ser. B. Stat. Methodol. 68, 49\u201367 (2007). https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00532.x","journal-title":"J. R. Stat. Soc. Ser. B. Stat. Methodol."},{"key":"2101_CR35","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10107-018-1329-6","volume":"179","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Zhang, N., Sun, D., Toh, K.C.: An efficient hessian based algorithm for solving large-scale sparse group lasso problems. Math. Program. 179, 223\u2013263 (2020). https:\/\/doi.org\/10.1007\/s10107-018-1329-6","journal-title":"Math. Program."},{"key":"2101_CR36","unstructured":"Zhou, X.: On the fenchel duality between strong convexity and lipschitz continuous gradient (2018). arXiv:1803.06573v1"},{"key":"2101_CR37","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/s10107-016-1100-9","volume":"165","author":"Z Zhou","year":"2017","unstructured":"Zhou, Z., So, A.M.C.: A unified approach to error bounds for structured convex optimization problems. Math. Program. 165, 689\u2013728 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1100-9","journal-title":"Math. Program."}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02101-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-023-02101-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-023-02101-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T21:13:35Z","timestamp":1677100415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-023-02101-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,6]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["2101"],"URL":"https:\/\/doi.org\/10.1007\/s10915-023-02101-z","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,6]]},"assertion":[{"value":"28 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"65"}}