Accelerated forward–backward algorithms for structured monotone inclusions

In this paper, we develop rapidly convergent forward–backward algorithms for computing zeroes of the sum of two maximally monotone operators. A modification of the classical forward–backward method is considered, by incorporating an inertial term (closed to the acceleration techniques introduced by...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational optimization and applications Ročník 88; číslo 1; s. 167 - 215
Hlavní autori:	Maingé, Paul-Emile, Weng-Law, André
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.05.2024 Springer Nature B.V Springer Verlag
Predmet:	Acceleration Algorithms Convergence Convex and Discrete Geometry Hilbert space Inclusions Management Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Preconditioning Saddle points Statistics Optimal gradient method Inertial-type algorithm Nesterov-type algorithm Restarting techniques Global rate of convergence 90C25 65F22 90C06 Fast first-order method global rate of convergence restarting techniques fast first-order method inertial-type algorithm optimal gradient method
ISSN:	0926-6003, 1573-2894
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	In this paper, we develop rapidly convergent forward–backward algorithms for computing zeroes of the sum of two maximally monotone operators. A modification of the classical forward–backward method is considered, by incorporating an inertial term (closed to the acceleration techniques introduced by Nesterov), a constant relaxation factor and a correction term, along with a preconditioning process. In a Hilbert space setting, we prove the weak convergence to equilibria of the iterates ( x n ) , with worst-case rates of o ( n - 1 ) in terms of both the discrete velocity and the fixed point residual, instead of the rates of O ( n - 1 / 2 ) classically established for related algorithms. Our procedure can be also adapted to more general monotone inclusions. In particular, we propose a fast primal-dual algorithmic solution to some class of convex-concave saddle point problems. In addition, we provide a well-adapted framework for solving this class of problems by means of standard proximal-like algorithms dedicated to structured monotone inclusions. Numerical experiments are also performed so as to enlighten the efficiency of the proposed strategy.
AbstractList	In this paper, we develop rapidly convergent forward-backward algorithms for computing zeroes of the sum of two maximally monotone operators. A modification of the classical forward-backward method is considered, by incorporating an inertial term (closed to the acceleration techniques introduced by Nesterov), a constant relaxation factor and a correction term, along with a preconditioning process. In a Hilbert space setting, we prove the weak convergence to equilibria of the iterates (xn), with worst-case rates of o(1/n) in terms of both the discrete velocity and the fixed point residual, instead of the rates of O(1/n^(1/2)) classically established for related algorithms. Our procedure can be also adapted to more general monotone inclusions. In particular, we propose a fast primal-dual algorithmic solution to some class of convex-concave saddle point problems. In addition, we provide a well-adapted framework for solving this class of problems by means of standard proximal-like algorithms dedicated to structured monotone inclusions. Numerical experiments are also performed so as to enlighten the efficiency of the proposed strategy. In this paper, we develop rapidly convergent forward–backward algorithms for computing zeroes of the sum of two maximally monotone operators. A modification of the classical forward–backward method is considered, by incorporating an inertial term (closed to the acceleration techniques introduced by Nesterov), a constant relaxation factor and a correction term, along with a preconditioning process. In a Hilbert space setting, we prove the weak convergence to equilibria of the iterates ( x n ) , with worst-case rates of o ( n - 1 ) in terms of both the discrete velocity and the fixed point residual, instead of the rates of O ( n - 1 / 2 ) classically established for related algorithms. Our procedure can be also adapted to more general monotone inclusions. In particular, we propose a fast primal-dual algorithmic solution to some class of convex-concave saddle point problems. In addition, we provide a well-adapted framework for solving this class of problems by means of standard proximal-like algorithms dedicated to structured monotone inclusions. Numerical experiments are also performed so as to enlighten the efficiency of the proposed strategy. In this paper, we develop rapidly convergent forward–backward algorithms for computing zeroes of the sum of two maximally monotone operators. A modification of the classical forward–backward method is considered, by incorporating an inertial term (closed to the acceleration techniques introduced by Nesterov), a constant relaxation factor and a correction term, along with a preconditioning process. In a Hilbert space setting, we prove the weak convergence to equilibria of the iterates (xn), with worst-case rates of o(n-1) in terms of both the discrete velocity and the fixed point residual, instead of the rates of O(n-1/2) classically established for related algorithms. Our procedure can be also adapted to more general monotone inclusions. In particular, we propose a fast primal-dual algorithmic solution to some class of convex-concave saddle point problems. In addition, we provide a well-adapted framework for solving this class of problems by means of standard proximal-like algorithms dedicated to structured monotone inclusions. Numerical experiments are also performed so as to enlighten the efficiency of the proposed strategy.
Author	Weng-Law, André Maingé, Paul-Emile
Author_xml	– sequence: 1 givenname: Paul-Emile surname: Maingé fullname: Maingé, Paul-Emile email: Paul-Emile.Mainge@univ-antilles.fr organization: F.W.I., MEMIAD, Université des Antilles – sequence: 2 givenname: André surname: Weng-Law fullname: Weng-Law, André organization: F.W.I., MEMIAD, Université des Antilles
BackLink	https://hal.science/hal-04744925$$DView record in HAL
BookMark	eNp9kL1OwzAURi0EEm3hBZgqMTEErn8Sx2NVAUWqxAKz5ThOm5LGxXZAbLwDb8iT4BAQEkMnW_Y5V9_9xuiwta1B6AzDJQbgVx5DmosECE0AUsYTeoBGOOU0Iblgh2gEgmRJBkCP0dj7DQAITskILWdam8Y4FUw5rax7Va78fP8olH7qr1PVrKyrw3rr-9-pD67ToXMR3trWhphiWre66XxtW3-CjirVeHP6c07Q4831w3yRLO9v7-azZaJpSkNSZVlVpKYguChyYXKeg8mgzCpaEkVLSlKmUgxCMMEqanhZKtC5oIWpRDRyOkEXw9y1auTO1Vvl3qRVtVzMlrJ_A8YZEyR9wZE9H9ids8-d8UFubOfaGE9SYJngHJN-Yj5Q2lnvnamkroMKcangVN1IDLLvWQ49y9iz_O5Z0qiSf-pvor0SHSQf4XZl3F-qPdYXWgWTfg
CitedBy_id	crossref_primary_10_1016_j_matcom_2025_07_041
Cites_doi	10.1007/s10208-013-9150-3 10.1007/s11228-020-00542-4 10.1007/s10107-012-0629-5 10.1007/s11075-021-01181-y 10.1007/s11228-023-00663-6 10.1007/s10107-021-01643-0 10.13140/RG.2.2.20063.92329 10.1137/080716542 10.1007/BF01581204 10.1002/cpa.20042 10.1016/0022-247X(79)90234-8 10.1007/s10851-014-0523-2 10.1137/110844805 10.1007/978-3-642-02431-3 10.1137/0329022 10.1016/j.jde.2016.08.020 10.1007/s10998-017-0192-1 10.1090/S0002-9947-1956-0084194-4 10.1137/0802032 10.1016/0167-2789(92)90242-F 10.1137/0314056 10.1007/s10444-011-9254-8 10.1137/050626090 10.1137/20M1333316 10.1137/0103003 10.1137/S0363012998338806 10.1007/s00245-021-09819-y 10.1007/s11228-011-0191-y 10.1007/s10107-013-0653-0 10.1137/15M1046095 10.1007/s10107-018-1252-x 10.1007/BF02761171 10.1016/S0377-0427(02)00906-8 10.1007/s10851-010-0251-1 10.1137/120872802 10.1007/s10957-015-0746-4 10.1137/130940402 10.1137/0716071 10.1007/s00245-019-09584-z 10.1007/978-3-319-48311-5 10.1007/s10957-012-0245-9
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ HCIFZ JQ2 K60 K6~ K7- L.- L6V L7M L~C L~D M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U 1XC
DOI	10.1007/s10589-023-00547-3
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) SciTech Premium Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global Computing Database Science Database Engineering Database ProQuest advanced technologies & aerospace journals ProQuest Advanced Technologies & Aerospace Collection ProQuest Databases ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection ProQuest Central Basic Hyper Article en Ligne (HAL)
DatabaseTitle	CrossRef ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	ProQuest Business Collection (Alumni Edition)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Statistics Mathematics
EISSN	1573-2894
EndPage	215
ExternalDocumentID	oai:HAL:hal-04744925v1 10_1007_s10589_023_00547_3
GroupedDBID	-52 -5D -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 28- 29F 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 7WY 88I 8AO 8FE 8FG 8FL 8FW 8TC 8UJ 8VB 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHQJS AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EBLON EBS EBU EDO EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M0N M2P M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9R PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS QWB R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZD 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 TH9 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WK8 YLTOR Z45 Z7R Z7S Z7X Z81 Z83 Z86 Z88 Z8M Z8N Z8R Z8U Z8W Z92 ZL0 ZMTXR ZWQNP ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U 1XC
ID	FETCH-LOGICAL-c353t-f66fb5eb21bb89e8780e60d6f3d2a3d3254a51099494f3e7dda0c893bef9bb883
IEDL.DBID	M7S
ISICitedReferencesCount	2
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001159939700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0926-6003
IngestDate	Tue Oct 14 20:47:09 EDT 2025 Wed Nov 26 14:53:02 EST 2025 Sat Nov 29 01:51:31 EST 2025 Tue Nov 18 22:30:13 EST 2025 Fri Feb 21 02:39:50 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	Optimal gradient method Inertial-type algorithm Nesterov-type algorithm Restarting techniques Global rate of convergence 90C25 65F22 90C06 Fast first-order method global rate of convergence restarting techniques fast first-order method inertial-type algorithm optimal gradient method
Language	English
License	Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c353t-f66fb5eb21bb89e8780e60d6f3d2a3d3254a51099494f3e7dda0c893bef9bb883
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
PQID	3046977128
PQPubID	30811
PageCount	49
ParticipantIDs	hal_primary_oai_HAL_hal_04744925v1 proquest_journals_3046977128 crossref_citationtrail_10_1007_s10589_023_00547_3 crossref_primary_10_1007_s10589_023_00547_3 springer_journals_10_1007_s10589_023_00547_3
PublicationCentury	2000
PublicationDate	2024-05-01
PublicationDateYYYYMMDD	2024-05-01
PublicationDate_xml	– month: 05 year: 2024 text: 2024-05-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationSubtitle	An International Journal
PublicationTitle	Computational optimization and applications
PublicationTitleAbbrev	Comput Optim Appl
PublicationYear	2024
Publisher	Springer US Springer Nature B.V Springer Verlag
Publisher_xml	– name: Springer US – name: Springer Nature B.V – name: Springer Verlag
References	Kim (CR25) 2021; 190 Maingé, Weng-Law (CR33) 2023 Cevher, Vu (CR11) 2020 Condat (CR16) 2013; 158 Lemaire, Penot (CR27) 1989 Martinet (CR34) 1970; 4 Lions, Mercier (CR28) 1979; 16 Chambolle, Pock (CR13) 2011; 40 Rockafellar, Wets (CR44) 1998 Attouch, Peypouquet, Redont (CR5) 2016; 261 Attouch, Peypouquet (CR4) 2019; 174 Lorenz, Pock (CR29) 2015; 51 Douglas, Rachford (CR19) 1956; 82 Raguet, Fadili, Peyré (CR42) 2013; 6 Güler (CR23) 1991; 29 CR8 Villa, Salzo, Baldassarre, Verri (CR49) 2013; 23 CR47 Bauschke, Combettes (CR6) 2017 Moudafi, Oliny (CR35) 2003; 155 Chambolle, Dossal (CR12) 2015; 166 Rockafellar (CR43) 1976; 14 Beck, Teboulle (CR7) 2009; 2 Attouch, Peypouquet (CR3) 2016; 26 Sebestyen, Tarcsay (CR46) 2017; 75 Corman, Yuan (CR17) 2014; 24 Combettes, Wajs (CR15) 2005; 4 Vu (CR50) 2013; 38 Daubechies, Defrise, De Mol (CR18) 2004; 57 Passty (CR40) 1979; 72 Peaceman, Rachford (CR41) 1955; 3 Brezis, Lions (CR10) 1978; 29 Maingé (CR30) 2021; 84 Drori, Teboulle (CR20) 2014; 145 Maingé (CR31) 2022; 29 Maingé, Labarre (CR32) 2021 Güler (CR24) 1992; 2 Rudin, Osher, Fatemi (CR45) 1992; 60 O’Donoghue, Candès (CR39) 2015; 15 Attouch, Cabot (CR1) 2019; 80 CR26 Nesterov (CR36) 1983; 27 Eckstein, Bertsekas (CR22) 1992; 55 Nesterov (CR37) 1983; 269 Attouch, László (CR2) 2020; 30 Brezis (CR9) 1973 Duchi, Singer (CR21) 2009; 10 Nesterov (CR38) 2013; 140 Combettes, Pesquet (CR14) 2012; 20 Tseng (CR48) 2000; 38 L Condat (547_CR16) 2013; 158 B Martinet (547_CR34) 1970; 4 Y Nesterov (547_CR37) 1983; 269 L Rudin (547_CR45) 1992; 60 H Brezis (547_CR9) 1973 A Beck (547_CR7) 2009; 2 547_CR47 PL Combettes (547_CR15) 2005; 4 I Daubechies (547_CR18) 2004; 57 PE Maingé (547_CR30) 2021; 84 H Attouch (547_CR3) 2016; 26 J Eckstein (547_CR22) 1992; 55 D Kim (547_CR25) 2021; 190 PE Maingé (547_CR33) 2023 Y Drori (547_CR20) 2014; 145 J Douglas (547_CR19) 1956; 82 DW Peaceman (547_CR41) 1955; 3 H Attouch (547_CR2) 2020; 30 A Moudafi (547_CR35) 2003; 155 GB Passty (547_CR40) 1979; 72 RT Rockafellar (547_CR43) 1976; 14 RT Rockafellar (547_CR44) 1998 HH Bauschke (547_CR6) 2017 S Villa (547_CR49) 2013; 23 DA Lorenz (547_CR29) 2015; 51 B Lemaire (547_CR27) 1989 H Raguet (547_CR42) 2013; 6 B Vu (547_CR50) 2013; 38 P Tseng (547_CR48) 2000; 38 Z Sebestyen (547_CR46) 2017; 75 547_CR26 H Attouch (547_CR1) 2019; 80 H Attouch (547_CR5) 2016; 261 PL Lions (547_CR28) 1979; 16 J Duchi (547_CR21) 2009; 10 O Güler (547_CR23) 1991; 29 H Attouch (547_CR4) 2019; 174 A Chambolle (547_CR13) 2011; 40 A Chambolle (547_CR12) 2015; 166 PE Maingé (547_CR31) 2022; 29 O Güler (547_CR24) 1992; 2 PL Combettes (547_CR14) 2012; 20 H Brezis (547_CR10) 1978; 29 B O’Donoghue (547_CR39) 2015; 15 PE Maingé (547_CR32) 2021 V Cevher (547_CR11) 2020 E Corman (547_CR17) 2014; 24 Y Nesterov (547_CR36) 1983; 27 547_CR8 Y Nesterov (547_CR38) 2013; 140
References_xml	– volume: 72 start-page: 383 year: 1979 end-page: 390 ident: CR40 article-title: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space publication-title: J. Math. Anal. Appl. – volume: 30 start-page: 3252 issue: 4 year: 2020 end-page: 3283 ident: CR2 article-title: Newton-like inertial dynamics and proximal algorithms governed by maximally monotone operators publication-title: SIAM J. Optim. – year: 2017 ident: CR6 publication-title: Convex Analysis and Monotone Operator Theory in Hilbert Spaces – volume: 29 start-page: 329 year: 1978 end-page: 345 ident: CR10 article-title: Produits infinis de résolvantes publication-title: Isr. J. Math. – volume: 60 start-page: 259 issue: 1–4 year: 1992 end-page: 268 ident: CR45 article-title: Nonlinear total variation based noise removal algorithms publication-title: Physica D – volume: 15 start-page: 715 issue: 3 year: 2015 end-page: 32 ident: CR39 article-title: Adaptive restart for accelerated gradient schemes publication-title: Found. Comput. Math. doi: 10.1007/s10208-013-9150-3 – year: 2020 ident: CR11 article-title: A reflected forward–backward splitting method for monotone inclusions involving Lipschitzian operators publication-title: Set-Valued Var. Anal. doi: 10.1007/s11228-020-00542-4 – volume: 140 start-page: 125 year: 2013 end-page: 161 ident: CR38 article-title: Gradient methods for minimizing composite objective function publication-title: Math. Program. Ser. B doi: 10.1007/s10107-012-0629-5 – volume: 14 start-page: 877 issue: 5 year: 1976 end-page: 898 ident: CR43 article-title: Monotone operators and the proximal point algorithm publication-title: SIAM J. Control Opt. – ident: CR8 – volume: 261 start-page: 5734 issue: 10 year: 2016 end-page: 5783 ident: CR5 article-title: Fast convex optimization via inertial dynamics with hessian driven damping publication-title: J. Differ. Equ. – volume: 27 start-page: 372 year: 1983 end-page: 376 ident: CR36 article-title: A method of solving a convex programming problem with convergence rate O(1/k2) publication-title: Soviet Math. Doklady – volume: 84 start-page: 2027 year: 2021 end-page: 2061 ident: CR30 article-title: Accelerated proximal algorithms with a correction term for monotone inclusions publication-title: Appl. Math. Optim. – volume: 155 start-page: 447 issue: 2 year: 2003 end-page: 454 ident: CR35 article-title: Convergence of a splitting inertial proximal method for monotone operators publication-title: J. Comput. Appl. Math. – year: 2021 ident: CR32 article-title: Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization publication-title: Numer. Algorithms doi: 10.1007/s11075-021-01181-y – year: 2023 ident: CR33 article-title: Fast continuous dynamics inside the graph of maximally monotone operators publication-title: Set-Valued Var. Anal. doi: 10.1007/s11228-023-00663-6 – volume: 23 start-page: 1607 issue: 3 year: 2013 end-page: 1633 ident: CR49 article-title: Accelerated and inexact forward–backward algorithms publication-title: SIAM J. Optim. – volume: 29 start-page: 893 year: 2022 end-page: 920 ident: CR31 article-title: Fast convergence of generalized forward–backward algorithms for structured monotone inclusions publication-title: J. Convex Anal. – volume: 51 start-page: 311 year: 2015 end-page: 325 ident: CR29 article-title: An inertial forward–backward algorithm for monotone inclusions publication-title: J. Math. Imaging Vis. – volume: 20 start-page: 307 issue: 2 year: 2012 end-page: 330 ident: CR14 article-title: Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators publication-title: Set-Valued Var. Anal. – volume: 57 start-page: 1413 year: 2004 end-page: 1457 ident: CR18 article-title: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint publication-title: Commun. Pure Appl. Math. – ident: CR26 – volume: 174 start-page: 391 year: 2019 end-page: 432 ident: CR4 article-title: Convergence of inertial dynamics and proximal algorithms governed by maximal monotone operators publication-title: Math. Program. – year: 1973 ident: CR9 publication-title: Opérateurs Maximaux Monotones – volume: 190 start-page: 57 year: 2021 end-page: 87 ident: CR25 article-title: Accelerated proximal point method for maximally monotone operators publication-title: Math. Program. doi: 10.1007/s10107-021-01643-0 – volume: 166 start-page: 968 issue: 3 year: 2015 end-page: 982 ident: CR12 article-title: On the convergence of the iterates of Fista publication-title: JOTA – volume: 82 start-page: 421 year: 1956 end-page: 439 ident: CR19 article-title: On the numerical solution of heat conduction problems in two and three space variables publication-title: Trans. Am. Math. Soc. – volume: 80 start-page: 547 year: 2019 end-page: 598 ident: CR1 article-title: Convergence of a relaxed inertial forward–backward algorithm for structured monotone inclusions publication-title: Appl. Math. Optim. – ident: CR47 – volume: 26 start-page: 1824 issue: 3 year: 2016 end-page: 1834 ident: CR3 article-title: The rate of convergence of Nesterov’s accelerated forward–backward method is actually faster than publication-title: SIAM J. Optim. – volume: 145 start-page: 451 issue: 1–2 year: 2014 end-page: 482 ident: CR20 article-title: Performance of first-order methods for smooth convex minimization: a novel approach publication-title: Math. Program. – volume: 16 start-page: 964 year: 1979 end-page: 979 ident: CR28 article-title: Splitting algorithms for the sum of two nonlinear operators publication-title: SIAM J. Numer. Anal. – volume: 2 start-page: 183 issue: 1 year: 2009 end-page: 202 ident: CR7 article-title: A fast iterative shrinkage-thresholding algorithm for linear inverse problems publication-title: SIAM J. Imaging Sci. – volume: 38 start-page: 667 issue: 3 year: 2013 end-page: 681 ident: CR50 article-title: A splitting algorithm for dual monotone inclusions involving cocoercive operators publication-title: Adv. Comput. Math. – volume: 2 start-page: 649 issue: 4 year: 1992 end-page: 664 ident: CR24 article-title: New proximal point algorithms for convex minimization publication-title: SIAM J. Optim. – year: 1998 ident: CR44 publication-title: Variational Analysis – volume: 4 start-page: 154 year: 1970 end-page: 158 ident: CR34 article-title: Régularisation d’inéquations variationnelles par approximations successives publication-title: Rev. Fr. Infor. Rech. Opération. – volume: 158 start-page: 460 issue: 2 year: 2013 end-page: 479 ident: CR16 article-title: A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms publication-title: J. Optim. Theory Appl. – volume: 55 start-page: 293 issue: 1–3 year: 1992 end-page: 318 ident: CR22 article-title: On the Douglas–Rachford splitting method and the proximal point algorithm for maximal monotone operators publication-title: Math. Program. – volume: 6 start-page: 1199 year: 2013 end-page: 1226 ident: CR42 article-title: A generalized forward–backward splitting publication-title: SIAM J. Imaging Sci. – volume: 38 start-page: 431 issue: 2 year: 2000 end-page: 446 ident: CR48 article-title: A modified forward–backward splitting method for maximal monotone mappings publication-title: SIAM J. Control. Optim. – start-page: 73 year: 1989 end-page: 87 ident: CR27 article-title: The proximal algorithm publication-title: New Methods in Optimization and Their Industrial Uses – volume: 40 start-page: 120 issue: 1 year: 2011 end-page: 145 ident: CR13 article-title: A first-order primal-dual algorithm for convex problems with applications to imaging publication-title: J. Math. Imaging Vis. – volume: 75 start-page: 268 year: 2017 end-page: 272 ident: CR46 article-title: On the square root of a positive selfadjoint operator publication-title: Period. Math. Hung. – volume: 4 start-page: 1168 issue: 4 year: 2005 end-page: 1200 ident: CR15 article-title: Signal recovery by proximal forward–backward splitting publication-title: SIAM Multiscale Model. Simul. – volume: 10 start-page: 2899 year: 2009 end-page: 2934 ident: CR21 article-title: Efficient online and batch learning using forward backward splitting publication-title: J. Mach. Learn. Res. – volume: 269 start-page: 543 issue: 3 year: 1983 end-page: 7 ident: CR37 article-title: A method for unconstrained convex minimization problem with the rate of convergence O(1/k2) publication-title: Dokl. Akad. Nauk. USSR – volume: 3 start-page: 28 issue: 1 year: 1955 end-page: 41 ident: CR41 article-title: The numerical solution of parabolic and elliptic differential equations publication-title: J. Soc. Ind. Appl. Math. – volume: 29 start-page: 403 year: 1991 end-page: 419 ident: CR23 article-title: On the convergence of the proximal point algorithm for convex minimization publication-title: SIAM J. Control Optim. – volume: 24 start-page: 1614 issue: 4 year: 2014 end-page: 1638 ident: CR17 article-title: A generalized proximal point algorithm and its convergence rate publication-title: SIAM J. Optim. – volume: 29 start-page: 893 year: 2022 ident: 547_CR31 publication-title: J. Convex Anal. – volume-title: Opérateurs Maximaux Monotones year: 1973 ident: 547_CR9 – volume: 15 start-page: 715 issue: 3 year: 2015 ident: 547_CR39 publication-title: Found. Comput. Math. doi: 10.1007/s10208-013-9150-3 – start-page: 73 volume-title: New Methods in Optimization and Their Industrial Uses year: 1989 ident: 547_CR27 – ident: 547_CR47 doi: 10.13140/RG.2.2.20063.92329 – volume: 2 start-page: 183 issue: 1 year: 2009 ident: 547_CR7 publication-title: SIAM J. Imaging Sci. doi: 10.1137/080716542 – volume: 140 start-page: 125 year: 2013 ident: 547_CR38 publication-title: Math. Program. Ser. B doi: 10.1007/s10107-012-0629-5 – volume: 55 start-page: 293 issue: 1–3 year: 1992 ident: 547_CR22 publication-title: Math. Program. doi: 10.1007/BF01581204 – ident: 547_CR8 – volume: 57 start-page: 1413 year: 2004 ident: 547_CR18 publication-title: Commun. Pure Appl. Math. doi: 10.1002/cpa.20042 – volume: 72 start-page: 383 year: 1979 ident: 547_CR40 publication-title: J. Math. Anal. Appl. doi: 10.1016/0022-247X(79)90234-8 – volume: 51 start-page: 311 year: 2015 ident: 547_CR29 publication-title: J. Math. Imaging Vis. doi: 10.1007/s10851-014-0523-2 – year: 2021 ident: 547_CR32 publication-title: Numer. Algorithms doi: 10.1007/s11075-021-01181-y – volume: 23 start-page: 1607 issue: 3 year: 2013 ident: 547_CR49 publication-title: SIAM J. Optim. doi: 10.1137/110844805 – volume-title: Variational Analysis year: 1998 ident: 547_CR44 doi: 10.1007/978-3-642-02431-3 – volume: 29 start-page: 403 year: 1991 ident: 547_CR23 publication-title: SIAM J. Control Optim. doi: 10.1137/0329022 – volume: 261 start-page: 5734 issue: 10 year: 2016 ident: 547_CR5 publication-title: J. Differ. Equ. doi: 10.1016/j.jde.2016.08.020 – volume: 75 start-page: 268 year: 2017 ident: 547_CR46 publication-title: Period. Math. Hung. doi: 10.1007/s10998-017-0192-1 – volume: 10 start-page: 2899 year: 2009 ident: 547_CR21 publication-title: J. Mach. Learn. Res. – volume: 190 start-page: 57 year: 2021 ident: 547_CR25 publication-title: Math. Program. doi: 10.1007/s10107-021-01643-0 – volume: 82 start-page: 421 year: 1956 ident: 547_CR19 publication-title: Trans. Am. Math. Soc. doi: 10.1090/S0002-9947-1956-0084194-4 – volume: 2 start-page: 649 issue: 4 year: 1992 ident: 547_CR24 publication-title: SIAM J. Optim. doi: 10.1137/0802032 – volume: 60 start-page: 259 issue: 1–4 year: 1992 ident: 547_CR45 publication-title: Physica D doi: 10.1016/0167-2789(92)90242-F – volume: 14 start-page: 877 issue: 5 year: 1976 ident: 547_CR43 publication-title: SIAM J. Control Opt. doi: 10.1137/0314056 – volume: 38 start-page: 667 issue: 3 year: 2013 ident: 547_CR50 publication-title: Adv. Comput. Math. doi: 10.1007/s10444-011-9254-8 – volume: 4 start-page: 1168 issue: 4 year: 2005 ident: 547_CR15 publication-title: SIAM Multiscale Model. Simul. doi: 10.1137/050626090 – volume: 4 start-page: 154 year: 1970 ident: 547_CR34 publication-title: Rev. Fr. Infor. Rech. Opération. – volume: 27 start-page: 372 year: 1983 ident: 547_CR36 publication-title: Soviet Math. Doklady – ident: 547_CR26 – volume: 30 start-page: 3252 issue: 4 year: 2020 ident: 547_CR2 publication-title: SIAM J. Optim. doi: 10.1137/20M1333316 – volume: 3 start-page: 28 issue: 1 year: 1955 ident: 547_CR41 publication-title: J. Soc. Ind. Appl. Math. doi: 10.1137/0103003 – volume: 38 start-page: 431 issue: 2 year: 2000 ident: 547_CR48 publication-title: SIAM J. Control. Optim. doi: 10.1137/S0363012998338806 – volume: 269 start-page: 543 issue: 3 year: 1983 ident: 547_CR37 publication-title: Dokl. Akad. Nauk. USSR – volume: 84 start-page: 2027 year: 2021 ident: 547_CR30 publication-title: Appl. Math. Optim. doi: 10.1007/s00245-021-09819-y – volume: 20 start-page: 307 issue: 2 year: 2012 ident: 547_CR14 publication-title: Set-Valued Var. Anal. doi: 10.1007/s11228-011-0191-y – volume: 145 start-page: 451 issue: 1–2 year: 2014 ident: 547_CR20 publication-title: Math. Program. doi: 10.1007/s10107-013-0653-0 – year: 2023 ident: 547_CR33 publication-title: Set-Valued Var. Anal. doi: 10.1007/s11228-023-00663-6 – volume: 26 start-page: 1824 issue: 3 year: 2016 ident: 547_CR3 publication-title: SIAM J. Optim. doi: 10.1137/15M1046095 – volume: 174 start-page: 391 year: 2019 ident: 547_CR4 publication-title: Math. Program. doi: 10.1007/s10107-018-1252-x – year: 2020 ident: 547_CR11 publication-title: Set-Valued Var. Anal. doi: 10.1007/s11228-020-00542-4 – volume: 29 start-page: 329 year: 1978 ident: 547_CR10 publication-title: Isr. J. Math. doi: 10.1007/BF02761171 – volume: 155 start-page: 447 issue: 2 year: 2003 ident: 547_CR35 publication-title: J. Comput. Appl. Math. doi: 10.1016/S0377-0427(02)00906-8 – volume: 40 start-page: 120 issue: 1 year: 2011 ident: 547_CR13 publication-title: J. Math. Imaging Vis. doi: 10.1007/s10851-010-0251-1 – volume: 6 start-page: 1199 year: 2013 ident: 547_CR42 publication-title: SIAM J. Imaging Sci. doi: 10.1137/120872802 – volume: 166 start-page: 968 issue: 3 year: 2015 ident: 547_CR12 publication-title: JOTA doi: 10.1007/s10957-015-0746-4 – volume: 24 start-page: 1614 issue: 4 year: 2014 ident: 547_CR17 publication-title: SIAM J. Optim. doi: 10.1137/130940402 – volume: 16 start-page: 964 year: 1979 ident: 547_CR28 publication-title: SIAM J. Numer. Anal. doi: 10.1137/0716071 – volume: 80 start-page: 547 year: 2019 ident: 547_CR1 publication-title: Appl. Math. Optim. doi: 10.1007/s00245-019-09584-z – volume-title: Convex Analysis and Monotone Operator Theory in Hilbert Spaces year: 2017 ident: 547_CR6 doi: 10.1007/978-3-319-48311-5 – volume: 158 start-page: 460 issue: 2 year: 2013 ident: 547_CR16 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-012-0245-9
SSID	ssj0009732
Score	2.3847811
Snippet	In this paper, we develop rapidly convergent forward–backward algorithms for computing zeroes of the sum of two maximally monotone operators. A modification of... In this paper, we develop rapidly convergent forward-backward algorithms for computing zeroes of the sum of two maximally monotone operators. A modification of...
SourceID	hal proquest crossref springer
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	167
SubjectTerms	Acceleration Algorithms Convergence Convex and Discrete Geometry Hilbert space Inclusions Management Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Preconditioning Saddle points Statistics
SummonAdditionalLinks	– databaseName: Springer Nature - Connect here FIRST to enable access dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NTsMwDLZgcBgHfgaIwkAV4gaV2qZtmuOEmHYYExIw7VY1bcMmjQ2t2868A2_Ik2D3ZxsIkODWNklT2Ultx_ZngAvFTSmUREs15GigCIcbKASVoVA22lJaPMyy0rpt3un4vZ64K5LC0jLavXRJZn_qlWQ3l8J7bGaQnoFbYx02XEKbIRv9vruE2uVZWTJT2J6B4pwVqTLfv-OTOFrvUzDkiqb5xTmayZzmzv--dhe2Cx1Tb-SLYg_WklENtlaQB_HudgHXmtagSipnjti8D-1GFKEsIgiJWEeVlsJq31_fJB304aUeDp_Gk8G0_5xSq54D0M4m2BlX9JiwvfXBKBrO6BguPYDH5s3Ddcsoai4YEXPZ1FCep6SL5rYlpS8Sn_tm4pmxp1hshyxmaE-GLnnTkK2KJTyOQzNCvspECRzhs0OojHCmI9BjTzI3Eo4lE-GwUEklrFD5lhUnVNbO1sAqSR9EBSA51cUYBksoZSJigEQMMiIGTIPLxZiXHI7j197nyNFFR0LSbjXaAT0zHe4QLuPc0qBeMjwo9m8akL8YNWMU3hpclQxeNv885fHfup9A1UYtKY-grEMFWZacwmY0R6ZPzrJ1_QEpavFq priority: 102 providerName: Springer Nature
Title	Accelerated forward–backward algorithms for structured monotone inclusions
URI	https://link.springer.com/article/10.1007/s10589-023-00547-3 https://www.proquest.com/docview/3046977128 https://hal.science/hal-04744925
Volume	88
WOSCitedRecordID	wos001159939700001&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: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1573-2894 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0009732 issn: 0926-6003 databaseCode: M0C dateStart: 20240101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1573-2894 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0009732 issn: 0926-6003 databaseCode: K7- dateStart: 20240101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1573-2894 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0009732 issn: 0926-6003 databaseCode: M7S dateStart: 20240101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest ABI/INFORM Collection customDbUrl: eissn: 1573-2894 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0009732 issn: 0926-6003 databaseCode: 7WY dateStart: 20240101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest advanced technologies & aerospace journals customDbUrl: eissn: 1573-2894 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0009732 issn: 0926-6003 databaseCode: P5Z dateStart: 20240101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1573-2894 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0009732 issn: 0926-6003 databaseCode: BENPR dateStart: 20240101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1573-2894 dateEnd: 20241213 omitProxy: false ssIdentifier: ssj0009732 issn: 0926-6003 databaseCode: M2P dateStart: 20240101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest – providerCode: PRVAVX databaseName: Springer Nature - Connect here FIRST to enable access customDbUrl: eissn: 1573-2894 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009732 issn: 0926-6003 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/eLvHCXMwpV3NTtwwEB51gQM9lPIntoVVVHGjFnGcxPGp2iIQEtvVCih_lyi2Y0DaLpQsnPsOvCFP0pmslwUkuHCxktixo3y2Z8YefwOw7mSoldNoqRYSDRQVS4ZC0DGHsjHSmsuiPpV21JHdbnZyonp-wa3ybpXjObGeqO2VoTXyTdrBQ10Fp9Mf138ZRY2i3VUfQqMB08SSwGvXvYMJ6a6sA5SFKkoZCnbhD834o3MJOQtFgpHWggPtmWBqXJBb5BOd88U2aS19dube-92f4ZPXO4P2qKPMw4dysAAfn7ARLkKnbQwKIeKOsAHqsuRP-_DvXtMKH14GRf8cKx5e_KkoNxgxz97eYGFs44pIvYPLgenf0vpbtQS_d7YPt3aZD7bAjEjEkLk0dTpBO5trnakyk1lYpqFNnbBRIaxAQ7JIaBsN8XSilNYWoUFAdekUvpGJZZgaYEsrENhUi8SomOtSxaJw2ileuIxzW1I8u6gJfPync-OZyCkgRj-fcCgTOjmik9fo5KIJG4_vXI94ON4s_Q0BfCxIFNq77U5Oz8JYxkTIeMebsDpGLPcDt8oncDXh-xjzSfbrTX55u7avMBuhOjRylVyFKYSoXIMZcze8rG5a0JDHpy2Y_rnd7e3j3Z5kmP4KtyiNeq26W2PaS84w3T84-g_tMvoB
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JT9wwFH5iqVR6gG6ow1Kiqj21UZM4ieMDqkZQNIgw6oG29GTirSBNhyUDVW_8B_4HP6q_hPeyMBSp3DhwixLHjuPPb7Gfvwfw1vFACafQUy04Oigi5j4qQec71I2RUiEvqlNp33Le72e7u-LLBFy2Z2EorLKViZWgNoea1sg_0g4e2iooTj8dHfuUNYp2V9sUGjUstuyf3-iylaub6zi-76Jo4_POWs9vsgr4miVs5Ls0dSpBhzJUKhM241lg08CkjpmoYIahx1QktF-EH-6Y5cYUgcYvV9YJfCNjWO8kTKMcTyljAv_-Y0zyy6uEaIGIUh8NCdYc0mmO6iUUnBQxn6wknNj_KMLJfQrDvGHj3tqWrbTdxtxD-09PYbaxq71uPRGewYQdPocnN9gWX0De1RqVLHFjGA9tdYoX_nt-oWgFEy-9YvATOzLa_1XSU69m1j09wcLYp0MiLfcOhnpwSuuL5Uv4ei_dmYepIbb0CjyTKpZoEYfKipgVTjkRFi4LQ2MpX1_UgbAdWakbpnVK-DGQY45oQoNENMgKDZJ14P31O0c1z8idpd8gYK4LEkV4r5tLuhfEPCbCybOwA0stQmQjmEo5hkcHPrQYGz_-f5MLd9e2Ao97O9u5zDf7W4swE6HpV4eFLsEUDpddhkf6bHRQnryupowHe_eNvStRBVDc
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JTtxAEC2xKUoObAFlEhYLkROxsN22231AaASMQIxGHEjErePeAGkyEDwQ5ZZ_yN_kc_gSqrwwEAluHLhZdi8q9-uuqu7qVwDrjgdKOIWeas7RQREx91EJOt-hboyUCnle3kr71uW9XnZyIo7G4F9zF4bCKps1sVyozYWmPfJNOsFDWwWX001Xh0Uc7Xa2L3_6lEGKTlqbdBoVRA7t71_ovhVbB7s41p-jqLN3vLPv1xkGfM0SNvRdmjqVoHMZKpUJm_EssGlgUsdMlDPD0HvKEzo7QiEcs9yYPNAohbJOYI2MYbvjMMljtCMobDDYGRH-8jI5WiCi1EejgtUXduprewkFKkXMJ4sJJ_kjpTh-RiGZD-zd_45oS83XmXnN_2wWpmt722tXE2QOxuxgHt49YGF8D9221qh8iTPDeGjDUxzx7Z-_inY28dHL-6coyPDsR0FfvYpx9_oKC6NMF0Rm7p0PdP-a9h2LBfj6IuIswsQAe_oAnkkVS7SIQ2VFzHKnnAhzl4WhsZTHL2pB2Iyy1DUDOyUC6csRdzQhQyIyZIkMyVqwcV_nsuIfebb0GoLnviBRh--3u5LeBTGPiYjyJmzBUoMWWS9YhRxBpQVfGryNPj_d5cfnW1uFNwg52T3oHX6CtxFahFW06BJM4GjZZZjSN8Pz4mqlnD0efH9p6N0BmAJZSg
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=Accelerated+forward%E2%80%93backward+algorithms+for+structured+monotone+inclusions&rft.jtitle=Computational+optimization+and+applications&rft.au=Maing%C3%A9%2C+Paul-Emile&rft.au=Weng-Law%2C+Andr%C3%A9&rft.date=2024-05-01&rft.pub=Springer+Verlag&rft.issn=0926-6003&rft.eissn=1573-2894&rft.volume=88&rft.issue=1&rft.spage=167&rft.epage=215&rft_id=info:doi/10.1007%2Fs10589-023-00547-3&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-04744925v1
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0926-6003&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0926-6003&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0926-6003&client=summon