{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T03:42:20Z","timestamp":1772941340532,"version":"3.50.1"},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012478","name":"Fundamental Research Funds of China West Normal University","doi-asserted-by":"publisher","award":["23kc010"],"award-info":[{"award-number":["23kc010"]}],"id":[{"id":"10.13039\/501100012478","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007433","name":"China West Normal University","doi-asserted-by":"publisher","award":["KCXTD2023-3"],"award-info":[{"award-number":["KCXTD2023-3"]}],"id":[{"id":"10.13039\/501100007433","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012542","name":"Sichuan Province Science and Technology Support Program","doi-asserted-by":"publisher","award":["2023NSFSC1922"],"award-info":[{"award-number":["2023NSFSC1922"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801455"],"award-info":[{"award-number":["11801455"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571320"],"award-info":[{"award-number":["12571320"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12161053"],"award-info":[{"award-number":["12161053"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100019530","name":"Science Fund for Distinguished Young Scholars of Gansu Province","doi-asserted-by":"publisher","award":["22JR5RA223"],"award-info":[{"award-number":["22JR5RA223"]}],"id":[{"id":"10.13039\/501100019530","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,10]]},"DOI":"10.1016\/j.cam.2026.117536","type":"journal-article","created":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:04:12Z","timestamp":1772294652000},"page":"117536","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Enhancing efficiency of proximal gradient method with predicted and corrected step sizes"],"prefix":"10.1016","volume":"485","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-2176-5223","authenticated-orcid":false,"given":"Xiaokai","family":"Chang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7459-0715","authenticated-orcid":false,"given":"Ke","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Sanyang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jen-Chih","family":"Yao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117536_bib0001","doi-asserted-by":"crossref","first-page":"2345","DOI":"10.1109\/TIP.2010.2047910","article-title":"Fast image recovery using variable splitting and constrained optimization","volume":"19","author":"Afonso","year":"2010","journal-title":"IEEE Trans. Image Process."},{"key":"10.1016\/j.cam.2026.117536_bib0002","first-page":"19","article-title":"Convex optimization with sparsity-inducing norms","volume":"5","author":"Bach","year":"2011","journal-title":"Optim. Mach. Learn."},{"key":"10.1016\/j.cam.2026.117536_bib0003","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1137\/080716542","article-title":"A fast iterative shrinkage-thresholding algorithm for linear inverse problems","volume":"2","author":"Beck","year":"2009","journal-title":"SIAM J. Img. Sci."},{"key":"10.1016\/j.cam.2026.117536_bib0004","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/MSP.2014.2329397","article-title":"Convex optimization for big data: scalable, randomized, and parallel algorithms for big data analytics","volume":"31","author":"Cevher","year":"2014","journal-title":"Signal Process. Mag. IEEE"},{"key":"10.1016\/j.cam.2026.117536_bib0005","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.cam.2017.11.033","article-title":"Convergent prediction-correction-based ADMM for multi-block separable convex programming","volume":"335","author":"Chang","year":"2018","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117536_bib0006","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","article-title":"Fixed-point continuation for l1-minimization: methodology and convergence","volume":"19","author":"Hale","year":"2008","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117536_bib0007","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","article-title":"Atomic decomposition by basis pursuit","volume":"20","author":"Chen","year":"1999","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.cam.2026.117536_bib0008","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","article-title":"Variable selection via nonconcave penalized likelihood and its oracle properties","volume":"96","author":"Fan","year":"2001","journal-title":"J. Am Stat. Assoc."},{"key":"10.1016\/j.cam.2026.117536_bib0009","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","article-title":"Nearly unbiased variable selection under minimax concave penalty","volume":"38","author":"Zhang","year":"2010","journal-title":"Ann. Stat."},{"key":"10.1016\/j.cam.2026.117536_bib0010","article-title":"Addendum: regularization and variable selection via the elastic net","volume":"67","author":"Zou","year":"2005","journal-title":"J. R. Statist. Soc."},{"key":"10.1016\/j.cam.2026.117536_bib0011","series-title":"ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"547","article-title":"Large-scale sparse logistic regression","author":"Liu","year":"2009"},{"key":"10.1016\/j.cam.2026.117536_bib0012","article-title":"Machine Learning","author":"Mitchell","year":"1997"},{"key":"10.1016\/j.cam.2026.117536_bib0013","unstructured":"K. Guo, X.M. Yuan, S.Z. Zeng, Convergence analysis of ISTA and FISTA for \u201cstrongly semi\u201d convex programming, http:\/\/www.optimization-online.org\/DBFILE\/2016\/06\/5506.pdf."},{"key":"10.1016\/j.cam.2026.117536_bib0014","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","article-title":"Signal recovery by proximal forward-backward splitting","volume":"4","author":"Combettes","year":"2005","journal-title":"Multiscale Model. Simul."},{"key":"10.1016\/j.cam.2026.117536_bib0015","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0716071","article-title":"Splitting algorithms for the sum of two nonlinear operators","volume":"16","author":"Lions","year":"1979","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/j.cam.2026.117536_bib0016","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1002\/cpa.20042","article-title":"An iterative thresholding algorithm for linear inverse problems with a sparsity constraint","volume":"57","author":"Daubechies","year":"2004","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1016\/j.cam.2026.117536_bib0017","doi-asserted-by":"crossref","first-page":"1824","DOI":"10.1137\/15M1046095","article-title":"The rate of convergence of Nesterov\u2019s accelerated forward-backward method is actually faster than 1\/k2","volume":"26","author":"Attouch","year":"2016","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117536_bib0018","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/130910294","article-title":"A dynamical approach to an inertial forward-backward algorithm for convex minimization","volume":"24","author":"Attouch","year":"2014","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117536_bib0019","first-page":"472","article-title":"Inertial Douglas-Rachford splitting for monotone inclusion problems","volume":"256","author":"Bot","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.cam.2026.117536_bib0020","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10589-017-9896-7","article-title":"Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions","volume":"67","author":"Johnstone","year":"2017","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cam.2026.117536_bib0021","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate O(1\/k2)","volume":"27","author":"Nesterov","year":"1983","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/j.cam.2026.117536_bib0022","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1007\/s10957-015-0746-4","article-title":"On the convergence of the iterates of the \u201cfast iterative shrinkage\/thresholding algorithm","volume":"166","author":"Chambolle","year":"2015","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.cam.2026.117536_bib0023","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1137\/16M106340X","article-title":"Activity identification and local linear convergence of forward-backward-type methods","volume":"27","author":"Liang","year":"2017","journal-title":"SIAM J. Optim."},{"issue":"3","key":"10.1016\/j.cam.2026.117536_bib0024","doi-asserted-by":"crossref","first-page":"A1069","DOI":"10.1137\/21M1395685","article-title":"Improving \u201cfast iterative shrinkage-thresholding algorithm\u201d: faster, smarter, and greedier","volume":"44","author":"Liang","year":"2022","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.cam.2026.117536_bib0025","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0022-247X(77)90152-4","article-title":"On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space","volume":"61","author":"Bruck","year":"1977","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"10.1016\/j.cam.2026.117536_bib0026","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1080\/10556788.2017.1300899","article-title":"Proximal extrapolated gradient methods for variational inequalities","volume":"33","author":"Malitsky","year":"2018","journal-title":"Optim. Method Softw."},{"key":"10.1016\/j.cam.2026.117536_bib0027","series-title":"First-Order methods in optimization, MOS-SIAM series on optimization","author":"Beck","year":"2017"},{"key":"10.1016\/j.cam.2026.117536_bib0028","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1080\/10556788.2016.1214959","article-title":"On the convergence of the forward-backward splitting method with linesearches","volume":"31","author":"Bello","year":"2016","journal-title":"Optim. Method Softw."},{"key":"10.1016\/j.cam.2026.117536_bib0029","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1080\/02331930008844508","article-title":"An extragradient-type algorithm for nonsmooth variational inequalities","volume":"48","author":"Iusem","year":"2000","journal-title":"Optim"},{"key":"10.1016\/j.cam.2026.117536_bib0030","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1080\/02331939708844365","article-title":"A variant of Korpelevich\u2019s method for variational inequalities with a new search strategy","volume":"42","author":"Iusem","year":"1997","journal-title":"Optim"},{"key":"10.1016\/j.cam.2026.117536_bib0031","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/0041-5553(87)90058-9","article-title":"Modification of the extragradient method for solving variational inequalities and certain optimization problems","volume":"27","author":"Khobotov","year":"1987","journal-title":"USSR Comp. Math. Phys."},{"key":"10.1016\/j.cam.2026.117536_bib0032","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","article-title":"Gradient methods for minimizing composite functions","volume":"140","author":"Nesterov","year":"2013","journal-title":"Math. Program., Ser. B"},{"key":"10.1016\/j.cam.2026.117536_bib0033","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1137\/S0363012997317475","article-title":"A new projection method for variational inequality problems","volume":"37","author":"Solodov","year":"1999","journal-title":"SIAM J.Control Optim."},{"key":"10.1016\/j.cam.2026.117536_bib0034","series-title":"37th International Conference on Machine Learning (ICML 2020), Virtual","article-title":"Adaptive gradient descent without descent","author":"Malitsky","year":"2020"},{"key":"10.1016\/j.cam.2026.117536_bib0035","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","article-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"Bauschke","year":"2011"},{"key":"10.1016\/j.cam.2026.117536_bib0036","series-title":"Introductory Lectures on Convex Optimization: a Basic Course","volume":"87","author":"Nesterov","year":"2013"},{"key":"10.1016\/j.cam.2026.117536_bib0037","first-page":"6067","article-title":"Golden ratio algorithms for variational inequalities","volume":"42","author":"Malitsky","year":"2019","journal-title":"Mathe. Program"},{"key":"10.1016\/j.cam.2026.117536_bib0038","doi-asserted-by":"crossref","unstructured":"R.T. Rockafellar, R.J.B. Wets, Variational Analysis. Grun. Mate. Wiss 317 (1998).","DOI":"10.1007\/978-3-642-02431-3"},{"key":"10.1016\/j.cam.2026.117536_bib0039","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1137\/16M1055323","article-title":"Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems","volume":"27","author":"Wen","year":"2017","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117536_bib0040","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/02331888.2012.719513","article-title":"Group variable selection via SCAD-l2","volume":"48","author":"Zeng","year":"2014","journal-title":"Statistics"},{"key":"10.1016\/j.cam.2026.117536_bib0041","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","article-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","volume":"3","author":"Boyd","year":"2010","journal-title":"Found. Trends Mach. Learn."},{"key":"10.1016\/j.cam.2026.117536_bib0042","first-page":"829","article-title":"A three-operator splitting scheme and its optimization applications. set-valued var","volume":"25","author":"Davis","year":"2017","journal-title":"Anal"},{"key":"10.1016\/j.cam.2026.117536_bib0043","doi-asserted-by":"crossref","first-page":"9089","DOI":"10.1007\/s12190-025-02610-0","article-title":"Enhanced proximal gradient methods with multi inertial terms for minimization problem","volume":"71","author":"Kankam","year":"2025","journal-title":"J. Appl. Math. Comput."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726001962?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726001962?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T10:56:37Z","timestamp":1772880997000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726001962"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":43,"alternative-id":["S0377042726001962"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117536","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Enhancing efficiency of proximal gradient method with predicted and corrected step sizes","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.117536","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":"117536"}}