{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T20:43:12Z","timestamp":1770669792899,"version":"3.49.0"},"reference-count":53,"publisher":"EDP Sciences","issue":"2","license":[{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"vor","delay-in-days":30,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72471227"],"award-info":[{"award-number":["72471227"]}],"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":["72071202"],"award-info":[{"award-number":["72071202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Laboratory of Mathematics and Engineering Applications, Ministry of Education"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2025,2,14]]},"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p>Narushima <jats:italic>et al<\/jats:italic>. [<jats:italic>SIAM J. Optim<\/jats:italic>. 21 (2011) 212\u2013230] proposed a three-term search direction that guarantees the sufficient descent condition. Building upon this work, we introduce a control factor to refine the search direction, which not only ensures the sufficient descent property but also possesses the trust-region feature, independent of the specific line search strategy. Furthermore, we extend the modified search direction to solve constrained nonlinear equations by employing a hyperplane projection technique. To enhance efficiency, we integrate an inertial acceleration mechanism, leading to an inertial variant of the proposed method. We rigorously establish the global convergence of the inertial method, even in the absence of Lipschitz continuity in the underlying mapping. Additionally, under appropriate conditions, we prove that the method achieves a linear convergence rate. Numerical experiments validate the effectiveness of our methods, demonstrating their superior performance in solving constrained nonlinear equations and restoring blurred images corrupted by Gaussian noise.<\/jats:p>","DOI":"10.1051\/ro\/2025022","type":"journal-article","created":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T12:44:38Z","timestamp":1739796278000},"page":"939-958","source":"Crossref","is-referenced-by-count":1,"title":["A three-term cg projected-based method with control factor and its inertial version for constrained nonlinear equations"],"prefix":"10.1051","volume":"59","author":[{"given":"Jiayi","family":"Li","sequence":"first","affiliation":[]},{"given":"Hu","family":"Shao","sequence":"additional","affiliation":[]},{"given":"Shengbei","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9176-6321","authenticated-orcid":false,"given":"Pengjie","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Guoxin","family":"Li","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2025,3,31]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"2561","DOI":"10.1051\/ro\/2023099","volume":"57","author":"Abdullahi","year":"2023","journal-title":"RAIRO-Oper. Res."},{"key":"R2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10589-014-9662-z","volume":"60","author":"Al-Baali","year":"2015","journal-title":"Comput. Optim. App."},{"key":"R3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s40314-022-02135-3","volume":"42","author":"Aji","year":"2023","journal-title":"Comput. Appl. Math."},{"key":"R4","doi-asserted-by":"crossref","first-page":"8792","DOI":"10.3934\/math.2021510","volume":"6","author":"Awwal","year":"2021","journal-title":"AIMS Math."},{"key":"R5","unstructured":"Bovik A.C., Handbook of Image and Video Processing. Academic Press (2010)."},{"key":"R6","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.apnum.2024.06.020","volume":"204","author":"Chen","year":"2024","journal-title":"Appl. Numer. Math."},{"key":"R7","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1007\/s11075-017-0299-8","volume":"76","author":"Cruz","year":"2017","journal-title":"Numer. Algorithms"},{"key":"R8","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1137\/1019005","volume":"19","author":"Dennis","year":"1977","journal-title":"SIAM Rev."},{"key":"R9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Facchinei F. and Pang J.S., Finite-dimensional Variational Inequalities and Complementarity Problems. Springer-Verlag, New York (2003).","DOI":"10.1007\/b97543"},{"key":"R11","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1109\/JSTSP.2007.910281","volume":"1","author":"Figueiredo","year":"2007","journal-title":"IEEE J. Sel. Top. Sign. Proces."},{"key":"R12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10092-018-0291-2","volume":"55","author":"Gao","year":"2018","journal-title":"Calcolo"},{"key":"R13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cam.2019.03.018","volume":"359","author":"Gao","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"R14","doi-asserted-by":"crossref","first-page":"e2424","DOI":"10.1002\/nla.2424","volume":"29","author":"Ibrahim","year":"2022","journal-title":"Numer. Linear Algebra App."},{"key":"R15","doi-asserted-by":"crossref","first-page":"30","DOI":"10.3934\/jimo.2021173","volume":"19","author":"Ibrahim","year":"2023","journal-title":"J. Ind. Manage. Optim."},{"key":"R16","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/s10898-022-01213-4","volume":"85","author":"Ivanov","year":"2023","journal-title":"J. Global Optim."},{"key":"R17","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s40314-022-02019-6","volume":"41","author":"Jian","year":"2022","journal-title":"Comput. Appl. Math."},{"key":"R18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s11075-018-0603-2","volume":"82","author":"Liu","year":"2019","journal-title":"Numer. Algorithms"},{"key":"R19","first-page":"8323865","volume":"2020","author":"Liu","year":"2020","journal-title":"Complexity"},{"key":"R20","first-page":"388","volume":"43","author":"Liu","year":"2021","journal-title":"Math. Numer. Sin."},{"key":"R21","doi-asserted-by":"crossref","first-page":"113822","DOI":"10.1016\/j.cam.2021.113822","volume":"403","author":"Liu","year":"2022","journal-title":"J. Comput. Appl. Math."},{"key":"R22","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.apnum.2022.02.001","volume":"175","author":"Liu","year":"2022","journal-title":"Appl. Numer. Math."},{"key":"R23","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1007\/s11075-023-01527-8","volume":"94","author":"Liu","year":"2023","journal-title":"Numer. Algorithms"},{"key":"R24","doi-asserted-by":"crossref","first-page":"e2471","DOI":"10.1002\/nla.2471","volume":"30","author":"Liu","year":"2023","journal-title":"Numer. Linear Algebra App."},{"key":"R25","doi-asserted-by":"crossref","unstructured":"Liu P.J., Li L.H., Shao H., Liu M.X. and Fan J.X., An inertial-type CG projection method with restart for pseudo-monotone costs with application to traffic assignment. Netw. Spatial Econ. (2024). DOI: 10.1007\/s11067-024-09653-z.","DOI":"10.1007\/s11067-024-09653-z"},{"key":"R26","doi-asserted-by":"crossref","first-page":"e2533","DOI":"10.1002\/nla.2533","volume":"31","author":"Liu","year":"2024","journal-title":"Numer. Linear Algebra App."},{"key":"R27","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1007\/s11075-022-01356-1","volume":"92","author":"Ma","year":"2023","journal-title":"Numer. Algorithms"},{"key":"R28","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1051\/ro\/2023010","volume":"57","author":"Mehamdia","year":"2023","journal-title":"RAIRO-Oper. Res."},{"key":"R29","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"Mor\u00e9","year":"1981","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"key":"R30","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1137\/080743573","volume":"21","author":"Narushima","year":"2011","journal-title":"SIAM J. Optim."},{"key":"R31","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF02591989","volume":"36","author":"Pang","year":"1986","journal-title":"Math. Program."},{"key":"R32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"Polyak","year":"1964","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"R33","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"Polyak","year":"1969","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"R34","first-page":"16","volume":"33","author":"Rui","year":"2012","journal-title":"J. Huaibei Normal Univ. (Nat. Sci.)"},{"key":"R35","doi-asserted-by":"crossref","first-page":"S1113","DOI":"10.1051\/ro\/2020061","volume":"55","author":"Sabi\u2019u","year":"2021","journal-title":"RAIRO-Oper. Res."},{"key":"R36","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/j.apm.2023.01.018","volume":"118","author":"Shao","year":"2023","journal-title":"Appl. Math. Modell."},{"key":"R37","doi-asserted-by":"crossref","unstructured":"Solodov M.V. and Svaiter B.F., A globally convergent inexact Newton method for systems of monotone equations, in Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods. Springer US, Boston, MA (1999) 355\u2013369.","DOI":"10.1007\/978-1-4757-6388-1_18"},{"key":"R38","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1002\/wics.1202","volume":"4","author":"Wang","year":"2012","journal-title":"Wiley Interdiscipl. Rev. Comput. Stat."},{"key":"R39","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TIP.2003.819861","volume":"13","author":"Wang","year":"2004","journal-title":"IEEE Trans. Image Process."},{"key":"R40","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s00186-006-0140-y","volume":"66","author":"Wang","year":"2007","journal-title":"Math. Methods Oper. Res."},{"key":"R41","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.2298\/FIL2305461W","volume":"37","author":"Waziri","year":"2023","journal-title":"Filomat"},{"key":"R42","doi-asserted-by":"crossref","first-page":"114879","DOI":"10.1016\/j.cam.2022.114879","volume":"422","author":"Wu","year":"2023","journal-title":"J. Comput. Appl. Math."},{"key":"R43","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1007\/s10957-023-02265-6","volume":"198","author":"Wu","year":"2023","journal-title":"J. Optim. Theory App."},{"key":"R44","doi-asserted-by":"crossref","first-page":"3570","DOI":"10.1016\/j.na.2011.02.040","volume":"74","author":"Xiao","year":"2011","journal-title":"Nonlinear Anal. Theory Methods App."},{"key":"R45","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10915-013-9815-8","volume":"61","author":"Xiao","year":"2014","journal-title":"J. Sci. Comput."},{"key":"R46","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s11075-020-01043-z","volume":"88","author":"Yin","year":"2021","journal-title":"Numer. Algorithms"},{"key":"R47","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10589-023-00513-z","volume":"87","author":"Yin","year":"2024","journal-title":"Comput. Optim. App."},{"key":"R48","doi-asserted-by":"crossref","first-page":"117","DOI":"10.3934\/jimo.2013.9.117","volume":"9","author":"Yu","year":"2013","journal-title":"J. Ind. Manage. Optim."},{"key":"R49","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10957-015-0781-1","volume":"168","author":"Yuan","year":"2016","journal-title":"J. Optim. Theory App."},{"key":"R50","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.apnum.2019.08.022","volume":"147","author":"Yuan","year":"2020","journal-title":"Appl. Numer. Math."},{"key":"R51","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1051\/ro\/2021159","volume":"55","author":"Zheng","year":"2021","journal-title":"RAIRO-Oper. Res."},{"key":"R52","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1090\/S0025-5718-08-02121-2","volume":"77","author":"Zhou","year":"2008","journal-title":"Math. Comput."},{"key":"R53","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10957-014-0547-1","volume":"164","author":"Zhou","year":"2015","journal-title":"J. Optim. Theory App."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2025022\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T08:28:09Z","timestamp":1743496089000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2025022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":53,"journal-issue":{"issue":"2"},"alternative-id":["ro230801"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2025022","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3]]}}}