{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:30:07Z","timestamp":1760059807596,"version":"build-2065373602"},"reference-count":46,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T00:00:00Z","timestamp":1752278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"publisher","award":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"],"award-info":[{"award-number":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific Research Project of Hubei Provincial Department of Education","award":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"],"award-info":[{"award-number":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"]}]},{"name":"Scientific Research Foundation of Hubei University of Education for Talent Introduction","award":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"],"award-info":[{"award-number":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"]}]},{"name":"Foundation for Innovative Research Team of Hubei Provincial Department of Education","award":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"],"award-info":[{"award-number":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"]}]},{"name":"National Natural Science Foundation of China","award":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"],"award-info":[{"award-number":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"]}]},{"name":"Fundamental Research Program of Shanxi Province, China","award":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"],"award-info":[{"award-number":["2025AFC080","23Q166","ESRC20220008","T2022034","12172266","202303021222208"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>This work focuses on split feasibility problems in Hilbert spaces. To accelerate the convergent rate of gradient-CQ algorithms, we introduce an inertial term. Additionally, non-monotone stepsizes are employed to adjust the relaxation parameter applied to the original stepsizes, ensuring that these original stepsizes maintain a positive lower bound. Thereby, the efficiency of the algorithms is improved. Moreover, the weak and strong convergence of the proposed algorithms are established through proofs that exhibit a similar symmetry structure and do not require the assumption of Lipschitz continuity for the gradient mappings. Finally, the LASSO problem is presented to illustrate and compare the performance of the algorithms.<\/jats:p>","DOI":"10.3390\/sym17071121","type":"journal-article","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T07:54:23Z","timestamp":1752479663000},"page":"1121","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Accelerated Gradient-CQ Algorithms for Split Feasibility Problems"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6734-0670","authenticated-orcid":false,"given":"Yu","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Institute of Big Data Analysis and Applied Mathematics, Hubei University of Education, Wuhan 430205, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Shanxi Datong University, Datong 037009, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,7,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02142692","article-title":"A multiprojection algorithm using Bregman projection in a product space","volume":"8","author":"Censor","year":"1994","journal-title":"Numer. Algorithms"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1088\/0266-5611\/20\/1\/006","article-title":"A unified treatment of some iterative algorithms in signal processing and image reconstruction","volume":"20","author":"Byrne","year":"2004","journal-title":"Inverse Probl."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1088\/0266-5611\/18\/2\/310","article-title":"Iterative oblique projection onto convex sets and the split feasibility problem","volume":"18","author":"Byrne","year":"2002","journal-title":"Inverse Probl."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2071","DOI":"10.1088\/0266-5611\/21\/6\/017","article-title":"The multiple-sets split feasibility problem and its applications for inverse problems","volume":"21","author":"Censor","year":"2005","journal-title":"Inverse Probl."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1383","DOI":"10.3934\/jimo.2016078","article-title":"Inertial accelerated algorithm for solving a split feasibility problem","volume":"13","author":"Dang","year":"2017","journal-title":"J. Ind. Manag. Optim."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"963","DOI":"10.3934\/jimo.2018080","article-title":"A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications","volume":"15","author":"Gibali","year":"2019","journal-title":"J. Ind. Manag. Optim."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, G., Martin, V., Wang, F., and Xu, H.K. (2012). Solving the split feasibility problem without prior knowledge of matrix norms. Inverse Probl., 28.","DOI":"10.1088\/0266-5611\/28\/8\/085004"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1007\/s11590-020-01603-1","article-title":"New inertial relaxed method for solving split feasibilities","volume":"15","author":"Shehu","year":"2020","journal-title":"Optim. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1007\/s11075-020-00999-2","article-title":"Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces","volume":"87","author":"Sahu","year":"2020","journal-title":"Numer. Algorithms"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1595","DOI":"10.3934\/jimo.2018023","article-title":"The modified inertial relaxed CQ algorithm for solving the split feasibility problems","volume":"23","author":"Suantai","year":"2018","journal-title":"J. Ind. Manag. Optim."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1007\/s12190-021-01585-y","article-title":"An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces","volume":"68","author":"Ma","year":"2021","journal-title":"J. Appl. Math. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1007\/s10898-020-00964-2","article-title":"An optimization approach to solving the split feasibility problem in Hilbert spaces","volume":"79","author":"Reich","year":"2021","journal-title":"J. Glob. Optim."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1007\/s10898-020-00963-3","article-title":"General splitting methods with linearization for the split feasibility problem","volume":"79","author":"Dong","year":"2021","journal-title":"J. Glob. Optim."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1007\/s10898-018-00735-0","article-title":"A subgradient algorithm for a class of nonlinear split feasibility problems: Application to jointly constrained Nash equilibrium models","volume":"73","author":"Yen","year":"2019","journal-title":"J. Glob. Optim."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10898-020-00899-8","article-title":"A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection","volume":"78","author":"Chen","year":"2020","journal-title":"J. Glob. Optim."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1007\/s10957-019-01563-2","article-title":"A Family of Projection Gradient Methods for Solving the Multiple-Sets Split Feasibility Problem","volume":"183","author":"Wang","year":"2019","journal-title":"J. Optim. Theory Appl."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10589-016-9884-3","article-title":"Analysis on Newton projection method for the split feasibility problem","volume":"67","author":"Qu","year":"2017","journal-title":"Comput. Optim. Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s13398-017-0476-6","article-title":"A fixed point method for solving a split feasibility problem in Hilbert spaces","volume":"113","author":"Qin","year":"2019","journal-title":"RACSAM"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.jmaa.2004.07.048","article-title":"On variable-step relaxed projection algorithm for variational inequalities","volume":"302","author":"Yang","year":"2005","journal-title":"J. Math. Anal. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10898-018-0628-z","article-title":"\u201cOptimal\u201d choice of the step length of the projection and contraction methods for solving the split feasibility problem","volume":"71","author":"Dong","year":"2018","journal-title":"J. Glob. Optim."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1007\/s11590-017-1148-3","article-title":"Note on the modified relaxation CQ algorithm for the split feasibility problem","volume":"12","author":"Gibali","year":"2018","journal-title":"Optim. Lett."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1007\/s11075-019-00790-y","article-title":"On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem","volume":"84","author":"Kesornprom","year":"2020","journal-title":"Numer. Algorithms"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1088\/0266-5611\/21\/5\/009","article-title":"A note on the CQ algorithm for the split feasibility problem","volume":"21","author":"Qu","year":"2005","journal-title":"Inverse Probl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s10589-018-0025-z","article-title":"A majorization\u2013Cminimization algorithm for split feasibility problems","volume":"71","author":"Xu","year":"2018","journal-title":"Comput. Optim. Appl."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1090\/S0002-9904-1967-11864-0","article-title":"Fixed points of nonexpanding maps","volume":"73","author":"Halpern","year":"1967","journal-title":"Bull. Am. Math. Soc."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","article-title":"Some methods of speeding up the convergence of iteration methods","volume":"4","author":"Polyak","year":"1964","journal-title":"Ussr Comput. Math. Math. Phys."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1016\/j.na.2011.09.005","article-title":"Approximation of zeros of inverse strongly monotone operators in Bachna spaces","volume":"75","author":"Saejung","year":"2012","journal-title":"Nolinear Anal."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1011253113155","article-title":"An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping","volume":"9","author":"Alvarez","year":"2001","journal-title":"Set-Valued Anal."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/s10957-016-0972-4","article-title":"Convergence of one-step projected gradient methods for variational inequalities","volume":"171","author":"Gobinddass","year":"2016","journal-title":"J. Optim. Theory Appl."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1137\/S1052623403427859","article-title":"Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert space","volume":"14","author":"Alvarez","year":"2004","journal-title":"SIAM J. Optim."},{"key":"ref_31","first-page":"543","article-title":"A method for solving the convex programming problem with convergence rate O(1\/k2)","volume":"269","author":"Nesterov","year":"1983","journal-title":"Dokl. Akad. Nauk. SSSR"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Bauschke, H.H., and Combettes, P.L. (2011). Convex Analysis and Monotone Operator Theory in Hilbert Spaces, Springer.","DOI":"10.1007\/978-1-4419-9467-7"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Agarwal, R.P., Regan, D.O., and Sahu, D.R. (2009). Fixed Point Theory for Lipschitzian-Type Mappings with Applications, Topological Fixed Point Theory and Its Applications, Springer.","DOI":"10.1155\/2009\/439176"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1016\/S0895-7177(00)00199-0","article-title":"Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings","volume":"32","author":"Osilike","year":"2000","journal-title":"Math. Comput. Model."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"2517","DOI":"10.1007\/s40840-018-0614-0","article-title":"A new CQ algorithm for solving split feasibility problems in Hilbert spaces","volume":"42","author":"Vinh","year":"2018","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/moor.26.2.248.10558","article-title":"A weak-to-strong convergence principle for fej\u00e9r-monotone methods in Hilbert spaces","volume":"26","author":"Bauschke","year":"2001","journal-title":"Math. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Xu, H.K. (2010). Iterative methods for solving the split feasibility in infinite-dimensional Hilbert spaces. Inverse Probl., 26.","DOI":"10.1088\/0266-5611\/26\/10\/105018"},{"key":"ref_38","first-page":"223","article-title":"Convergence theorems for inertial KM-type algorithms","volume":"219","year":"2018","journal-title":"J. Comput. Appl. Math."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Ma, X., Jia, Z., and Li, Q. (2024). On inertial non-lipschitz stepsize algorithms for split feasibility problems. Comp. Appl. Math., 43.","DOI":"10.1007\/s40314-024-02922-0"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the Lasso","volume":"58","author":"Tibshirani","year":"1996","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1007\/s11075-023-01589-8","article-title":"Alternated inertial algorithms for split feasibility problems","volume":"95","author":"Tan","year":"2024","journal-title":"Numer. Algor"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Okeke, C.C., Okorie, K.O., Nwakpa, C.E., and Mewomo, O.T. (2025). Two-step inertial accelerated algorithms for solving split feasibility problem with multiple output sets. Commun. Nonlinear Sci. Numer. Simul., 141.","DOI":"10.1016\/j.cnsns.2024.108461"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"van Thang, T. (2024). Projection algorithms with adaptive step sizes for multiple output split mixed variational inequality problems. Comp. Appl. Math., 43.","DOI":"10.1007\/s40314-024-02896-z"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"2369","DOI":"10.1080\/02331934.2019.1638389","article-title":"Proximal type algorithms involving linesearch and inertial technique for split variational inclusion problem in hilbert spaces with applications","volume":"68","author":"Kesornprom","year":"2019","journal-title":"Optimization"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10915-015-0078-4","article-title":"An Implementable Splitting Algorithm for the \u21131-norm Regularized Split Feasibility Problem","volume":"67","author":"He","year":"2016","journal-title":"J. Sci. Comput."},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Ma, X., Liu, H., and Li, X. (2022). The iterative method for solving the proximal split feasibility problem with an application to LASSO problem. Comp. Appl. Math., 41.","DOI":"10.1007\/s40314-021-01703-3"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/7\/1121\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:09:07Z","timestamp":1760033347000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/7\/1121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,12]]},"references-count":46,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2025,7]]}},"alternative-id":["sym17071121"],"URL":"https:\/\/doi.org\/10.3390\/sym17071121","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2025,7,12]]}}}