New Splitting Algorithm with Three Inertial Steps for Three-Operator Monotone Inclusion Problems
This paper introduces a new splitting algorithm to solve a three-operator monotone inclusion problem that comprises of the sum of a maximal monotone operator, Lipschitz continuous monotone operator, and a cocoercive operator in real Hilbert spaces. The new splitting algorithm features the following...
Uloženo v:
| Vydáno v: | Journal of optimization theory and applications Ročník 206; číslo 3; s. 64 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
Springer Nature B.V
01.09.2025
|
| Témata: | |
| ISSN: | 0022-3239, 1573-2878 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | This paper introduces a new splitting algorithm to solve a three-operator monotone inclusion problem that comprises of the sum of a maximal monotone operator, Lipschitz continuous monotone operator, and a cocoercive operator in real Hilbert spaces. The new splitting algorithm features the following (i) three different inertial extrapolation steps; (ii) one forward evaluation of the Lipschitz continuous monotone operator, one forward evaluation of the cocoercive operator and one backward evaluation of the maximal monotone operator at each iteration. The more interesting feature of the proposed algorithm is that each of the involved operators is evaluated at different inertial step. We establish weak, strong and linear convergence of the sequence of iterates under standard assumptions, respectively. Several known splitting algorithms for the monotone inclusion problems of three-operator sum that have appeared in the literature are considered as special cases of our algorithm. Numerical tests confirm the superiority of our algorithm over related ones in the literature. |
|---|---|
| AbstractList | This paper introduces a new splitting algorithm to solve a three-operator monotone inclusion problem that comprises of the sum of a maximal monotone operator, Lipschitz continuous monotone operator, and a cocoercive operator in real Hilbert spaces. The new splitting algorithm features the following (i) three different inertial extrapolation steps; (ii) one forward evaluation of the Lipschitz continuous monotone operator, one forward evaluation of the cocoercive operator and one backward evaluation of the maximal monotone operator at each iteration. The more interesting feature of the proposed algorithm is that each of the involved operators is evaluated at different inertial step. We establish weak, strong and linear convergence of the sequence of iterates under standard assumptions, respectively. Several known splitting algorithms for the monotone inclusion problems of three-operator sum that have appeared in the literature are considered as special cases of our algorithm. Numerical tests confirm the superiority of our algorithm over related ones in the literature. |
| ArticleNumber | 64 |
| Author | Peng, Zai-Yun Yao, Yonghong Salisu, Sani Shehu, Yekini |
| Author_xml | – sequence: 1 givenname: Yonghong surname: Yao fullname: Yao, Yonghong – sequence: 2 givenname: Sani surname: Salisu fullname: Salisu, Sani – sequence: 3 givenname: Zai-Yun surname: Peng fullname: Peng, Zai-Yun – sequence: 4 givenname: Yekini surname: Shehu fullname: Shehu, Yekini |
| BookMark | eNotkEtLAzEQgINUsK3-AU8Bz6uT1yY5luKjoFZoPcfsmm23bDdrklL890brYWYY5mNm-CZo1PveIXRN4JYAyLtIQAtZABU5JCcFOUNjIiQrqJJqhMYAlBaMMn2BJjHuAEArycfo49Ud8Wro2pTafoNn3caHNm33-JgzXm-Dc3jRu5Ba2-FVckPEjQ-nQbEcXLApty--9yl_lNG6O8TW9_gt-Kpz-3iJzhvbRXf1X6fo_eF-PX8qnpePi_nsuagpVakQuqodtVrVpQAuhKCsAquEFfRT6RKqxgqrrS4lENZwCyWrXS05U8ArRTWbopvT3iH4r4OLyez8IfT5pGGUKMG1oDxT9ETVwccYXGOG0O5t-DYEzK9JczJpsknzZ9IQ9gNPd2gL |
| Cites_doi | 10.1137/120872802 10.3934/math.20231077 10.1016/j.cnsns.2023.107613 10.1007/s11075-015-0007-5 10.1007/s10957-012-0245-9 10.1090/S0002-9904-1967-11761-0 10.1007/978-1-4419-9569-8_10 10.1080/02331934.2013.855210 10.1090/S0002-9947-1956-0084194-4 10.1137/080716542 10.1080/01630563.2020.1867866 10.1137/130940402 10.1137/17M1120099 10.1080/02331934.2019.1647203 10.1016/S0377-0427(02)00906-8 10.1007/s10851-010-0251-1 10.1007/s11228-017-0421-z 10.3390/sym10110563 10.1016/j.cnsns.2024.108172 10.1186/s13660-019-2229-x 10.1137/050626090 10.1007/s10589-017-9909-6 10.1137/0314056 10.1137/0716071 10.1186/s13660-023-02913-5 10.3934/math.2024672 10.1016/0041-5553(64)90137-5 10.1080/02331934.2022.2107926 10.24193/fpt-ro.2020.1.07 10.1137/18M1207260 10.1007/s10957-015-0746-4 10.1137/S0363012998338806 10.24033/bsmf.1625 10.1002/cpa.20042 10.1080/10556788.2024.2307470 10.1007/s10107-019-01403-1 10.1007/s10444-011-9254-8 10.1007/s10589-019-00073-1 10.1109/TIP.2003.819861 10.1007/s41980-019-00312-5 10.1007/s10114-022-0649-x 10.1007/s10957-019-01601-z 10.1007/s10288-020-00440-3 10.1016/j.jmaa.2016.06.025 10.1515/math-2022-0536 10.1080/01630563.2021.2001749 10.1007/s11228-020-00542-4 10.1007/s10915-021-01608-7 10.1080/02331934.2020.1858832 10.1007/s11228-022-00631-6 10.24193/fpt-ro.2023.1.05 10.1007/978-1-4419-9467-7 10.1051/m2an/197004R301541 10.1137/14097238X 10.24193/fpt-ro.2021.2.36 10.24193/fpt-ro.2021.1.07 10.1007/s10851-014-0523-2 10.1007/s40314-023-02583-5 10.1080/00207160.2019.1622687 10.1016/j.na.2010.02.010 10.1007/s00245-019-09597-8 |
| ContentType | Journal Article |
| Copyright | The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025. |
| Copyright_xml | – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025. |
| DBID | AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 KR7 L7M L~C L~D |
| DOI | 10.1007/s10957-025-02741-1 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Civil Engineering Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1573-2878 |
| ExternalDocumentID | 10_1007_s10957_025_02741_1 |
| GroupedDBID | -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 28- 29L 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7WY 88I 8AO 8FE 8FG 8FL 8G5 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX ABAKF ABBBX ABBRH ABBXA ABDBE ABDPE ABDZT ABECU ABFSG ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADHKG ADKNI ADKPE ADRFC ADTPH ADURQ ADXHL ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFFHD AFGCZ AFHIU AFKRA AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMVHM AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU CITATION COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ7 GQ8 GROUPED_ABI_INFORM_RESEARCH GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M2O M2P M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O93 O9G O9I O9J OAM OVD P19 P2P P62 P9R PF0 PHGZM PHGZT PQBIZ PQBZA PQGLB PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SDD SDH SDM SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC TUS TWZ U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 VOH W23 W48 WH7 WK8 YLTOR YQT Z45 ZCG ZMTXR ZWQNP ZY4 ~EX 7SC 7TB 8FD AESKC FR3 JQ2 KR7 L7M L~C L~D |
| ID | FETCH-LOGICAL-c228t-59bce2a98c650455523b0a85a52d8960bfa5a9a967013f4a063cec743804b8293 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001508221400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0022-3239 |
| IngestDate | Wed Nov 05 08:27:34 EST 2025 Sat Nov 29 07:33:31 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c228t-59bce2a98c650455523b0a85a52d8960bfa5a9a967013f4a063cec743804b8293 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 3218549524 |
| PQPubID | 48247 |
| ParticipantIDs | proquest_journals_3218549524 crossref_primary_10_1007_s10957_025_02741_1 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-09-00 20250901 |
| PublicationDateYYYYMMDD | 2025-09-01 |
| PublicationDate_xml | – month: 09 year: 2025 text: 2025-09-00 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Journal of optimization theory and applications |
| PublicationYear | 2025 |
| Publisher | Springer Nature B.V |
| Publisher_xml | – name: Springer Nature B.V |
| References | Y Malitsky (2741_CR44) 2020; 30 LC Ceng (2741_CR21) 2022; 20 CX Zong (2741_CR68) 2022; 38 P Cholamjiak (2741_CR25) 2021; 88 PL Lions (2741_CR41) 1979; 16 P Latafat (2741_CR40) 2017; 68 LM Briceño-Arias (2741_CR6) 2015; 64 A Chambolle (2741_CR23) 2015; 66 2741_CR10 LC Ceng (2741_CR18) 2021; 22 V Cevher (2741_CR22) 2021; 29 Y Nesterov (2741_CR49) 1983; 27 2741_CR51 2741_CR13 A Moudafi (2741_CR47) 2003; 5 2741_CR11 Z Wu (2741_CR64) 2019; 73 2741_CR12 HH Bauschke (2741_CR3) 2011 H Raguet (2741_CR52) 2013; 6 D Davis (2741_CR33) 2017; 25 Z Opial (2741_CR50) 1967; 73 P Tseng (2741_CR59) 2000; 38 Y Malitsky (2741_CR43) 2015; 25 A Moudafi (2741_CR48) 2003; 155 RT Rockafellar (2741_CR54) 1976; 14 LC Ceng (2741_CR15) 2023; 8 C Zong (2741_CR69) 2024; 73 D Van Hieu (2741_CR61) 2020; 46 PL Combettes (2741_CR27) 2005; 4 D Van Hieu (2741_CR60) 2021; 19 LC Ceng (2741_CR14) 2024; 9 FJ Aragón-Artacho (2741_CR1) 2022; 30 BC Vũ (2741_CR62) 2013; 38 J Duchi (2741_CR37) 2009; 10 EK Ryu (2741_CR57) 2020; 184 R Suparatulatorn (2741_CR58) 2020; 97 2741_CR46 Z Wang (2741_CR63) 2004; 13 K Kratuloek (2741_CR39) 2024; 43 2741_CR45 H Attouch (2741_CR2) 2018; 457 LC Ceng (2741_CR16) 2020; 21 A Beck (2741_CR4) 2009; 2 J Rieger (2741_CR53) 2020; 381 T-Y Zhao (2741_CR66) 2020; 42 EK Ryu (2741_CR55) 2020; 182 YD Dong (2741_CR34) 2010; 72 LM Briceño-Arias (2741_CR7) 2018; 28 C Zong (2741_CR67) 2018; 10 LC Ceng (2741_CR19) 2023; 24 RI Boţ (2741_CR5) 2016; 71 2741_CR8 2741_CR9 HH Cui (2741_CR31) 2021; 22 J Douglas (2741_CR36) 1956; 82 A Chambolle (2741_CR24) 2011; 40 2741_CR26 L Condat (2741_CR28) 2013; 158 DA Lorenz (2741_CR42) 2015; 51 E Corman (2741_CR29) 2014; 24 J Fan (2741_CR38) 2021; 42 LC Ceng (2741_CR20) 2021; 70 2741_CR65 LC Ceng (2741_CR17) 2021; 70 Q-L Dong (2741_CR35) 2024; 39 I Daubechies (2741_CR32) 2004; 57 EK Ryu (2741_CR56) 2016; 15 ER Csetnek (2741_CR30) 2019; 80 |
| References_xml | – volume: 6 start-page: 1199 year: 2013 ident: 2741_CR52 publication-title: SIAM J. Imaging Sci. doi: 10.1137/120872802 – volume: 8 start-page: 21138 year: 2023 ident: 2741_CR15 publication-title: AIMS Math. doi: 10.3934/math.20231077 – ident: 2741_CR9 doi: 10.1016/j.cnsns.2023.107613 – volume: 71 start-page: 519 year: 2016 ident: 2741_CR5 publication-title: Numer. Algor. doi: 10.1007/s11075-015-0007-5 – volume: 5 start-page: 283 year: 2003 ident: 2741_CR47 publication-title: Int. J. Pure Appl. Math. – volume: 158 start-page: 460 issue: 2 year: 2013 ident: 2741_CR28 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-012-0245-9 – volume: 73 start-page: 591 year: 1967 ident: 2741_CR50 publication-title: Bull. Am. Math. Soc. doi: 10.1090/S0002-9904-1967-11761-0 – ident: 2741_CR26 doi: 10.1007/978-1-4419-9569-8_10 – volume: 64 start-page: 1239 issue: 5 year: 2015 ident: 2741_CR6 publication-title: Optimization doi: 10.1080/02331934.2013.855210 – volume: 82 start-page: 421 year: 1956 ident: 2741_CR36 publication-title: Trans. Amer. Math. Soc. doi: 10.1090/S0002-9947-1956-0084194-4 – ident: 2741_CR12 – volume: 2 start-page: 183 year: 2009 ident: 2741_CR4 publication-title: SIAM J. Imaging Sci. doi: 10.1137/080716542 – volume: 42 start-page: 69 year: 2020 ident: 2741_CR66 publication-title: Numer. Funct. Anal. Optim. doi: 10.1080/01630563.2020.1867866 – volume: 24 start-page: 1614 year: 2014 ident: 2741_CR29 publication-title: SIAM J. Optim. doi: 10.1137/130940402 – volume: 28 start-page: 2839 year: 2018 ident: 2741_CR7 publication-title: SIAM J. Optim. doi: 10.1137/17M1120099 – volume: 70 start-page: 715 year: 2021 ident: 2741_CR20 publication-title: Optimization doi: 10.1080/02331934.2019.1647203 – volume: 155 start-page: 447 year: 2003 ident: 2741_CR48 publication-title: J. Comput. Appl. Math. doi: 10.1016/S0377-0427(02)00906-8 – volume: 40 start-page: 120 issue: 1 year: 2011 ident: 2741_CR24 publication-title: J. Math. Imaging Vis. doi: 10.1007/s10851-010-0251-1 – volume: 25 start-page: 829 year: 2017 ident: 2741_CR33 publication-title: Set Valued Var. Anal. doi: 10.1007/s11228-017-0421-z – volume: 10 start-page: 563 year: 2018 ident: 2741_CR67 publication-title: Symmetry doi: 10.3390/sym10110563 – ident: 2741_CR10 doi: 10.1016/j.cnsns.2024.108172 – ident: 2741_CR11 doi: 10.1186/s13660-019-2229-x – volume: 4 start-page: 1168 year: 2005 ident: 2741_CR27 publication-title: SIAM Multiscale Model. Simul. doi: 10.1137/050626090 – ident: 2741_CR65 – volume: 68 start-page: 57 year: 2017 ident: 2741_CR40 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-017-9909-6 – volume: 14 start-page: 877 year: 1976 ident: 2741_CR54 publication-title: SIAM J. Control Optim. doi: 10.1137/0314056 – volume: 15 start-page: 3 year: 2016 ident: 2741_CR56 publication-title: Appl. Comput. Math. – volume: 16 start-page: 964 year: 1979 ident: 2741_CR41 publication-title: SIAM J. Numer. Anal. doi: 10.1137/0716071 – ident: 2741_CR13 doi: 10.1186/s13660-023-02913-5 – volume: 9 start-page: 13819 year: 2024 ident: 2741_CR14 publication-title: AIMS Math. doi: 10.3934/math.2024672 – ident: 2741_CR51 doi: 10.1016/0041-5553(64)90137-5 – volume: 73 start-page: 401 year: 2024 ident: 2741_CR69 publication-title: Optimization doi: 10.1080/02331934.2022.2107926 – volume: 21 start-page: 93 year: 2020 ident: 2741_CR16 publication-title: Fixed Point Theory doi: 10.24193/fpt-ro.2020.1.07 – volume: 27 start-page: 372 year: 1983 ident: 2741_CR49 publication-title: Doklady – volume: 30 start-page: 1451 issue: 2 year: 2020 ident: 2741_CR44 publication-title: SIAM J. Optim. doi: 10.1137/18M1207260 – volume: 66 start-page: 968 issue: 3 year: 2015 ident: 2741_CR23 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-015-0746-4 – volume: 38 start-page: 431 issue: 2 year: 2000 ident: 2741_CR59 publication-title: SIAM J. Control Optim. doi: 10.1137/S0363012998338806 – ident: 2741_CR46 doi: 10.24033/bsmf.1625 – volume: 57 start-page: 1413 year: 2004 ident: 2741_CR32 publication-title: Commun. Pure Appl. Math. doi: 10.1002/cpa.20042 – volume: 10 start-page: 2899 year: 2009 ident: 2741_CR37 publication-title: J. Mach. Learn. Res. – ident: 2741_CR8 doi: 10.1186/s13660-023-02913-5 – volume: 39 start-page: 431 year: 2024 ident: 2741_CR35 publication-title: Optim. Methods Softw. doi: 10.1080/10556788.2024.2307470 – volume: 182 start-page: 233 year: 2020 ident: 2741_CR55 publication-title: Math. Program. doi: 10.1007/s10107-019-01403-1 – volume: 38 start-page: 667 issue: 3 year: 2013 ident: 2741_CR62 publication-title: Adv. Comput. Math. doi: 10.1007/s10444-011-9254-8 – volume: 73 start-page: 129 year: 2019 ident: 2741_CR64 publication-title: Comp. Optim. Appl. doi: 10.1007/s10589-019-00073-1 – volume: 13 start-page: 600 issue: 4 year: 2004 ident: 2741_CR63 publication-title: IEEE Trans. Image Process. doi: 10.1109/TIP.2003.819861 – volume: 46 start-page: 1055 year: 2020 ident: 2741_CR61 publication-title: Bull. Iran. Math. Soc. doi: 10.1007/s41980-019-00312-5 – volume: 38 start-page: 443 year: 2022 ident: 2741_CR68 publication-title: Acta. Math. Sin. English Ser. doi: 10.1007/s10114-022-0649-x – volume: 184 start-page: 858 year: 2020 ident: 2741_CR57 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-019-01601-z – volume: 19 start-page: 127 year: 2021 ident: 2741_CR60 publication-title: J Oper Res doi: 10.1007/s10288-020-00440-3 – volume: 457 start-page: 1095 year: 2018 ident: 2741_CR2 publication-title: J. Math. Anal. Appl. doi: 10.1016/j.jmaa.2016.06.025 – volume: 20 start-page: 1770 year: 2022 ident: 2741_CR21 publication-title: Open Math. doi: 10.1515/math-2022-0536 – volume: 42 start-page: 1627 year: 2021 ident: 2741_CR38 publication-title: Numer. Funct. Anal. Optim. doi: 10.1080/01630563.2021.2001749 – volume: 29 start-page: 163 year: 2021 ident: 2741_CR22 publication-title: Set-Valued Var. Anal. doi: 10.1007/s11228-020-00542-4 – volume: 88 start-page: 85 year: 2021 ident: 2741_CR25 publication-title: J. Sci. Comput. doi: 10.1007/s10915-021-01608-7 – volume: 70 start-page: 1337 year: 2021 ident: 2741_CR17 publication-title: Optimization doi: 10.1080/02331934.2020.1858832 – volume: 30 start-page: 1011 year: 2022 ident: 2741_CR1 publication-title: Set-Valued Var. Anal. doi: 10.1007/s11228-022-00631-6 – volume: 24 start-page: 101 year: 2023 ident: 2741_CR19 publication-title: Fixed Point Theory doi: 10.24193/fpt-ro.2023.1.05 – volume-title: Convex Analysis and Monotone Operator Theory in Hilbert Spaces year: 2011 ident: 2741_CR3 doi: 10.1007/978-1-4419-9467-7 – ident: 2741_CR45 doi: 10.1051/m2an/197004R301541 – volume: 381 year: 2020 ident: 2741_CR53 publication-title: Appl. Math. Comput. – volume: 25 start-page: 502 year: 2015 ident: 2741_CR43 publication-title: SIAM J. Optim. doi: 10.1137/14097238X – volume: 22 start-page: 543 year: 2021 ident: 2741_CR18 publication-title: Fixed Point Theory doi: 10.24193/fpt-ro.2021.2.36 – volume: 22 start-page: 93 year: 2021 ident: 2741_CR31 publication-title: Fixed Point Theory doi: 10.24193/fpt-ro.2021.1.07 – volume: 51 start-page: 311 year: 2015 ident: 2741_CR42 publication-title: J. Math. Imaging Vis. doi: 10.1007/s10851-014-0523-2 – volume: 43 start-page: 70 year: 2024 ident: 2741_CR39 publication-title: Computational and Applied Mathematics doi: 10.1007/s40314-023-02583-5 – volume: 97 start-page: 1431 issue: 7 year: 2020 ident: 2741_CR58 publication-title: International Journal of Computer Mathematics doi: 10.1080/00207160.2019.1622687 – volume: 72 start-page: 4307 year: 2010 ident: 2741_CR34 publication-title: Nonlinear Anal. doi: 10.1016/j.na.2010.02.010 – volume: 80 start-page: 665 year: 2019 ident: 2741_CR30 publication-title: Appl. Math. Optim. doi: 10.1007/s00245-019-09597-8 |
| SSID | ssj0009874 |
| Score | 2.4296057 |
| Snippet | This paper introduces a new splitting algorithm to solve a three-operator monotone inclusion problem that comprises of the sum of a maximal monotone operator,... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Index Database |
| StartPage | 64 |
| SubjectTerms | Algorithms Hilbert space Lipschitz condition Operators (mathematics) Splitting |
| Title | New Splitting Algorithm with Three Inertial Steps for Three-Operator Monotone Inclusion Problems |
| URI | https://www.proquest.com/docview/3218549524 |
| Volume | 206 |
| WOSCitedRecordID | wos001508221400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLink customDbUrl: eissn: 1573-2878 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009874 issn: 0022-3239 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEG0I8aAHv40omh68aRPptrQ9EiPRRJEENNxqW7pKgkDYxd_vtLuIJHrwuNnN7GZmp_OmnXmD0IVImYPIRYl3QhCWpJ4YJsHdWSgbdyxVPvLMPohORw4GqltBV3-e4IcmN8UFCWNXI9cKCblOo1k0a_VeVgy7ckm5TElCE1V2yPwuYj0KrS_CMbK0d_73Tbtou0SQuFWYfA9V_GQfbf3gFYSrx28y1uwAvcJChnsANmOJM26N36bzUf7-gcMeLO6DMT2-n4T6ahAbqr4yDEi2uEGeZj4exGNw_mkg7oZH3XgR9thwtxhGkx2i5_Zt_-aOlIMViKNU5oQrG-aAKekAnzHOIRm110Zyw-lQQkpjU8ONMqopACCmzACMcWDLQE7PrASAcISqE3jjMcIW8hfnjVVmKJl1wghIGJWxVKWWCWNq6HKpaD0r-DP0iik5aFGDFnXUom7UUH1pC136UqYTQCGQxXLKTv4l7BRt0mihUBBWR9V8vvBnaMN95qNsfh5_ni_g-7sX |
| linkProvider | Springer Nature |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=New+Splitting+Algorithm+with+Three+Inertial+Steps+for+Three-Operator+Monotone+Inclusion+Problems&rft.jtitle=Journal+of+optimization+theory+and+applications&rft.au=Yao%2C+Yonghong&rft.au=Salisu%2C+Sani&rft.au=Peng%2C+Zai-Yun&rft.au=Shehu%2C+Yekini&rft.date=2025-09-01&rft.issn=0022-3239&rft.eissn=1573-2878&rft.volume=206&rft.issue=3&rft_id=info:doi/10.1007%2Fs10957-025-02741-1&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10957_025_02741_1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0022-3239&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0022-3239&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0022-3239&client=summon |