{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T20:36:38Z","timestamp":1776458198912,"version":"3.51.2"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T00:00:00Z","timestamp":1667520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T00:00:00Z","timestamp":1667520000000},"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":["DMS - 1816449"],"award-info":[{"award-number":["DMS - 1816449"]}],"id":[{"id":"10.13039\/100000001","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":["304133\/2021-3"],"award-info":[{"award-number":["304133\/2021-3"]}],"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":["405349\/2021-1"],"award-info":[{"award-number":["405349\/2021-1"]}],"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":[[2023,3]]},"DOI":"10.1007\/s10589-022-00421-8","type":"journal-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T09:02:46Z","timestamp":1667552566000},"page":"295-318","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On FISTA with a relative error rule"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7877-5688","authenticated-orcid":false,"given":"Yunier","family":"Bello-Cruz","sequence":"first","affiliation":[]},{"given":"Max L. N.","family":"Gon\u00e7alves","sequence":"additional","affiliation":[]},{"given":"Nathan","family":"Krislock","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,4]]},"reference":[{"issue":"2","key":"421_CR1","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/s10957-019-01525-8","volume":"182","author":"VA Adona","year":"2019","unstructured":"Adona, V.A., Gon\u00e7alves, M.L.N., Melo, J.G.: A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis. J. Optim. Theory Appl. 182(2), 640\u2013666 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"421_CR2","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s10589-020-00191-1","volume":"76","author":"VA Adona","year":"2020","unstructured":"Adona, V.A., Gon\u00e7alves, M.L.N., Melo, J.G.: An inexact proximal generalized alternating direction method of multipliers. Comput. Optim. Appl. 76(3), 621\u2013647 (2020)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"421_CR3","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10589-019-00165-y","volume":"75","author":"MM Alves","year":"2020","unstructured":"Alves, M.M., Eckstein, J., Geremia, M., Melo, J.G.: Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms. Comput. Optim. Appl. 75(2), 389\u2013422 (2020)","journal-title":"Comput. Optim. Appl."},{"key":"421_CR4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719604","volume-title":"LAPACK Users\u2019 Guide","author":"E Anderson","year":"1999","unstructured":"Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users\u2019 Guide, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia, PA (1999)","edition":"3"},{"issue":"1","key":"421_CR5","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/17M1114739","volume":"28","author":"H Attouch","year":"2018","unstructured":"Attouch, H., Cabot, A.: Convergence rates of inertial forward-backward algorithms. SIAM J. Optim. 28(1), 849\u2013874 (2018)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"421_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-018-1369-3","volume":"179","author":"H Attouch","year":"2018","unstructured":"Attouch, H., Cabot, A., Chbani, Z., Riahi, H.: Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization. J. Optim. Theory Appl. 179(1), 1\u201336 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20132","key":"421_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-016-0992-8","volume":"168","author":"H Attouch","year":"2018","unstructured":"Attouch, H., Chbani, Z., Peypouquet, J., Redont, P.: Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Math. Program. 168(1\u20132), 123\u2013175 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"421_CR8","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1137\/15M1046095","volume":"26","author":"H Attouch","year":"2016","unstructured":"Attouch, H., Peypouquet, J.: The rate of convergence of Nesterov\u2019s accelerated forward-backward method is actually faster than $$1\/k^2$$. SIAM J. Optim. 26(3), 1824\u20131834 (2016)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"421_CR9","doi-asserted-by":"publisher","first-page":"2408","DOI":"10.1137\/140994964","volume":"25","author":"JF Aujol","year":"2015","unstructured":"Aujol, J.F., Dossal, C.: Stability of over-relaxations for the forward-backward algorithm, application to FISTA. SIAM J. Optim. 25(4), 2408\u20132433 (2015)","journal-title":"SIAM J. Optim."},{"key":"421_CR10","first-page":"1","volume":"192","author":"HH Bauschke","year":"2019","unstructured":"Bauschke, H.H., Bui, M., Wang, X.: Applying FISTA to optimization problems (with or) without minimizers. Math. Program. 192, 1\u201320 (2019)","journal-title":"Math. Program."},{"key":"421_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex analysis and monotone operator theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in Hilbert Spaces, 2nd edn. CMS Books in Mathematics. Springer International Publishing, Cham (2017)","edition":"2"},{"issue":"1","key":"421_CR12","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-thresholding algorithm for linear inverse problems. SIAM J. Imag. Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imag. Sci."},{"key":"421_CR13","doi-asserted-by":"crossref","unstructured":"Beck, A., Teboulle, M.: Gradient-based algorithms with applications to signal-recovery problems. In: Convex optimization in signal processing and communications, pp. 42\u201388. Cambridge Univ. Press, Cambridge (2010)","DOI":"10.1017\/CBO9780511804458.003"},{"issue":"2","key":"421_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s11228-016-0376-5","volume":"25","author":"JY Bello Cruz","year":"2017","unstructured":"Bello Cruz, J.Y.: On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions. Set-Valued Var. Anal. 25(2), 245\u2013263 (2017)","journal-title":"Set-Valued Var. Anal."},{"issue":"6","key":"421_CR15","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1080\/10556788.2016.1214959","volume":"31","author":"JY Bello Cruz","year":"2016","unstructured":"Bello Cruz, J.Y., Nghia, T.A.: On the convergence of the forward-backward splitting method with linesearches. Optim. Methods Softw. 31(6), 1209\u20131238 (2016)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"421_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.: Julia: A fresh approach to numerical computing. SIAM Review 59(1), 65\u201398 (2017)","journal-title":"SIAM Review"},{"key":"421_CR17","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1093\/imanum\/drn085","volume":"30","author":"R Borsdorf","year":"2010","unstructured":"Borsdorf, R., Higham, N.J.: A preconditioned Newton algorithm for the nearest correlation matrix. IMA J. Numer. Anal. 30, 94\u2013107 (2010)","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"421_CR18","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1007\/s10957-015-0746-4","volume":"166","author":"A Chambolle","year":"2015","unstructured":"Chambolle, A., Dossal, C.: On the convergence of the iterates of the \u201cfast iterative shrinkage\/thresholding algorithm\u2019\u2019. J. Optim. Theory Appl. 166(3), 968\u2013982 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"421_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"421_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-012-0528-9","volume":"141","author":"J Eckstein","year":"2013","unstructured":"Eckstein, J., Silva, P.J.S.: A practical relative error criterion for augmented Lagrangians. Math. Programming 141(1), 319\u2013348 (2013). https:\/\/doi.org\/10.1007\/s10107-012-0528-9","journal-title":"Math. Programming"},{"issue":"2","key":"421_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10589-017-9911-z","volume":"68","author":"J Eckstein","year":"2017","unstructured":"Eckstein, J., Yao, W.: Approximate ADMM algorithms derived from Lagrangian splitting. Comput. Optim. Appl. 68(2), 363\u2013405 (2017). https:\/\/doi.org\/10.1007\/s10589-017-9911-z","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"421_CR22","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10107-017-1160-5","volume":"170","author":"J Eckstein","year":"2018","unstructured":"Eckstein, J., Yao, W.: Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM. Math. Programming 170(2), 417\u2013444 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1160-5","journal-title":"Math. Programming"},{"issue":"2","key":"421_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2950048","volume":"43","author":"N Gould","year":"2016","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw. 43(2), 1\u20135 (2016)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"421_CR24","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: Fixed-point continuation for $$l_1$$-minimization: methodology and convergence. SIAM J. Optim. 19(3), 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"421_CR25","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1137\/110847081","volume":"22","author":"K Jiang","year":"2012","unstructured":"Jiang, K., Sun, D., Toh, K.C.: An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP. SIAM J. Optim. 22(3), 1042\u20131064 (2012)","journal-title":"SIAM J. Optim."},{"issue":"9","key":"421_CR26","doi-asserted-by":"publisher","first-page":"1989","DOI":"10.1016\/j.jmva.2009.04.008","volume":"100","author":"D Lewandowski","year":"2009","unstructured":"Lewandowski, D., Kurowicka, D., Joe, H.: Generating random correlation matrices based on vines and extended onion method. J. Multivar. Anal. 100(9), 1989\u20132001 (2009)","journal-title":"J. Multivar. Anal."},{"issue":"4","key":"421_CR27","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1007\/s10898-019-00808-8","volume":"75","author":"RD Mill\u00e1n","year":"2019","unstructured":"Mill\u00e1n, R.D., Machado, M.P.: Inexact proximal $$\\epsilon $$-subgradient methods for composite convex optimization problems. J. Global Optim. 75(4), 1029\u20131060 (2019)","journal-title":"J. Global Optim."},{"issue":"6","key":"421_CR28","doi-asserted-by":"publisher","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RDC Monteiro","year":"2010","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean. SIAM J. Optim. 20(6), 2755\u20132787 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"421_CR29","first-page":"1092","volume":"23","author":"RDC Monteiro","year":"2013","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods SIAM. J. Optim. 23(2), 1092\u20131125 (2013)","journal-title":"J. Optim."},{"issue":"1","key":"421_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2049662.2049669","volume":"38","author":"JL Morales","year":"2011","unstructured":"Morales, J.L., Nocedal, J.: Remark on \u201cAlgorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization\u2019\u2019. ACM Trans. Math. Softw. 38(1), 1\u20134 (2011)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"421_CR31","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20(1), 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"421_CR32","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})$$. Dokl. Akad. Nauk SSSR 269(3), 543\u2013547 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"issue":"3","key":"421_CR33","first-page":"509","volume":"24","author":"Y Nesterov","year":"1988","unstructured":"Nesterov, Y.: An approach to constructing optimal methods for minimization of smooth convex functions. \u00c8konom. i Mat. Metody 24(3), 509\u2013517 (1988)","journal-title":"\u00c8konom. i Mat. Metody"},{"issue":"1","key":"421_CR34","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103(1), 127\u2013152 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"421_CR35","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(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"issue":"11","key":"421_CR36","doi-asserted-by":"publisher","first-page":"204","DOI":"10.21105\/joss.00204","volume":"2","author":"M Pastell","year":"2017","unstructured":"Pastell, M.: Weave.jl: Scientific reports using Julia. J. Open Source Softw. 2(11), 204 (2017). https:\/\/doi.org\/10.21105\/joss.00204","journal-title":"J. Open Source Softw."},{"issue":"2","key":"421_CR37","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1137\/050624509","volume":"28","author":"H Qi","year":"2006","unstructured":"Qi, H., Sun, D.: A quadratically convergent Newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28(2), 360\u2013385 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"421_CR38","unstructured":"Qi, H., Sun, D., Gao, Y.: CorNewton3.m: A Matlab code for computing the nearest correlation matrix with fixed diagonal and off diagonal elements. https:\/\/www.polyu.edu.hk\/ama\/profile\/dfsun\/CorNewton3.m (2009)"},{"issue":"4","key":"421_CR39","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":"421_CR40","unstructured":"Schmidt, M., Roux, N.L., Bach, F.R.: Convergence rates of inexact proximal-gradient methods for convex optimization. In: Advances in Neural Information Processing Systems 24, pp. 1458\u20131466. Curran Associates, Inc. (2011)"},{"issue":"4","key":"421_CR41","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1008777829180","volume":"7","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Anal. 7(4), 323\u2013345 (1999)","journal-title":"Set-Valued Anal."},{"key":"421_CR42","first-page":"153","volume":"17","author":"W Su","year":"2016","unstructured":"Su, W., Boyd, S., Cand\u00e8s, E.J.: A differential equation for modeling Nesterov\u2019s accelerated gradient method: theory and insights. J. Mach. Learn. Res. 17, 153 (2016)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"421_CR43","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1109\/TIT.2005.864420","volume":"52","author":"JA Tropp","year":"2006","unstructured":"Tropp, J.A.: Just relax: convex programming methods for identifying sparse signals in noise. IEEE Trans. Inform. Theory 52(3), 1030\u20131051 (2006)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"421_CR44","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-backward algorithms. SIAM J. Optim. 23(3), 1607\u20131633 (2013)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"421_CR45","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. 23(4), 550\u2013560 (1997)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00421-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00421-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00421-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T05:59:52Z","timestamp":1676613592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00421-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,4]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["421"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00421-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,4]]},"assertion":[{"value":"3 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}