Practical proximal primal-dual algorithms for structured saddle point problems Practical proximal primal-dual algorithms for structured saddle point problems
In this paper, we are concerned with a class of convex-concave saddle point problems, where one of the objective parts is assumed to be a convex and smooth function with Lipschitz continuous gradient. By exploiting the bilinear structure of the objective, we first propose a practical accelerated Pro...
Saved in:
| Published in: | Journal of global optimization Vol. 93; no. 3; pp. 803 - 831 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Springer US
01.11.2025
Springer Nature B.V |
| Subjects: | |
| ISSN: | 0925-5001, 1573-2916 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In this paper, we are concerned with a class of convex-concave saddle point problems, where one of the objective parts is assumed to be a convex and smooth function with Lipschitz continuous gradient. By exploiting the bilinear structure of the objective, we first propose a practical accelerated Proximal Primal-Dual algorithm (PPD+), which possesses an
O
(
1
/
N
2
)
convergence rate measured by the residual between two successive iterates, where
N
represents the iteration counter. In some cases, considering that the underlying subproblems of PPD+ cannot be easily solved exactly or up to a high precision, we further propose two inexact versions of the PPD+ under absolute and relative error criteria. Finally, we employ a restarting technique to enhance our algorithms for the purpose of making them more robust and efficient. A series of numerical experiments demonstrate that our algorithms perform well in practice. |
|---|---|
| AbstractList | In this paper, we are concerned with a class of convex-concave saddle point problems, where one of the objective parts is assumed to be a convex and smooth function with Lipschitz continuous gradient. By exploiting the bilinear structure of the objective, we first propose a practical accelerated Proximal Primal-Dual algorithm (PPD+), which possesses an
O
(
1
/
N
2
)
convergence rate measured by the residual between two successive iterates, where
N
represents the iteration counter. In some cases, considering that the underlying subproblems of PPD+ cannot be easily solved exactly or up to a high precision, we further propose two inexact versions of the PPD+ under absolute and relative error criteria. Finally, we employ a restarting technique to enhance our algorithms for the purpose of making them more robust and efficient. A series of numerical experiments demonstrate that our algorithms perform well in practice. In this paper, we are concerned with a class of convex-concave saddle point problems, where one of the objective parts is assumed to be a convex and smooth function with Lipschitz continuous gradient. By exploiting the bilinear structure of the objective, we first propose a practical accelerated Proximal Primal-Dual algorithm (PPD+), which possesses an O(1/N2) convergence rate measured by the residual between two successive iterates, where N represents the iteration counter. In some cases, considering that the underlying subproblems of PPD+ cannot be easily solved exactly or up to a high precision, we further propose two inexact versions of the PPD+ under absolute and relative error criteria. Finally, we employ a restarting technique to enhance our algorithms for the purpose of making them more robust and efficient. A series of numerical experiments demonstrate that our algorithms perform well in practice. |
| Author | Qu, Yunfei He, Hongjin Han, Deren Zhang, Tao |
| Author_xml | – sequence: 1 givenname: Yunfei surname: Qu fullname: Qu, Yunfei organization: School of Science, China University of Geosciences – sequence: 2 givenname: Hongjin surname: He fullname: He, Hongjin organization: School of Mathematics and Statistics, Ningbo University – sequence: 3 givenname: Tao surname: Zhang fullname: Zhang, Tao organization: School of Mathematics and Statistics, Linyi University – sequence: 4 givenname: Deren orcidid: 0000-0002-0427-8224 surname: Han fullname: Han, Deren email: handr@buaa.edu.cn organization: LMIB, School of Mathematical Sciences, Beihang University |
| BookMark | eNp9UMtKAzEUDVLBtvoDrgZcR29eM5OlFLVCURe6Dmkedcp0UpMZqH9v2hHcuboH7nnce2Zo0oXOIXRN4JYAVHeJQC1rDFRgIIILfDhDUyIqhqkk5QRNQeaVACAXaJbSFgBkLegUvbxFbfrG6LbYx3BodidwHNgOGet2E2LTf-5S4UMsUh8H0w_R2SJpa1tX7EPT9UftunW7dInOvW6Tu_qdc_Tx-PC-WOLV69Pz4n6FDa1ojzWz1NCS51sJF4ZbTkDYkuhyrSm3tee1YGuhq5J7bpgVVFe1t1aCtA68ZHN0M_rm4K_BpV5twxC7HKkYrTjnAiRkFh1ZJoaUovPq9Fr8VgTUsTc19qZyb-rUmzpkERtFKZO7jYt_1v-ofgD5HXNy |
| Cites_doi | 10.1137/140963467 10.1137/20M1379344 10.1007/s10589-020-00186-y 10.1137/21M1408683 10.1007/s10915-025-02802-7 10.1137/18M1224568 10.1007/s12190-023-01899-z 10.1007/s10589-017-9911-z 10.1007/s10107-022-01901-9 10.1109/ICASSP40776.2020.9053722 10.1007/s10851-010-0251-1 10.1109/TMI.2015.2437894 10.1137/10081602X 10.1007/s11590-021-01775-4 10.1137/19M1293855 10.1137/21M1395685 10.1016/0041-5553(85)90100-4 10.1007/s11228-017-0421-z 10.1137/1.9781611973402.110 10.1007/s11075-021-01069-x 10.1016/j.orl.2015.02.001 10.1007/s10957-020-01806-7 10.1111/j.1467-9868.2005.00490.x 10.1007/s00211-013-0580-2 10.1137/110836936 10.1016/j.orl.2024.107199 10.1090/mcom/3610 10.1137/09076934X 10.1137/21M1453463 10.1007/s10208-013-9150-3 10.1007/s11075-023-01509-w 10.1287/moor.27.4.681.305 10.1007/s40305-024-00568-7 10.1088/0266-5611/29/2/025011 10.1007/s10589-017-9909-6 10.1137/100814494 10.1007/s10915-023-02105-9 10.1007/s10107-012-0629-5 10.1093/imanum/drz007 10.1109/CDC.2014.7040179 10.1007/s10957-012-0245-9 10.1016/j.disopt.2017.08.004 10.1137/18M1213488 10.1137/16M1093094 10.1007/s10915-020-01330-w 10.1186/s13663-016-0543-2 10.1007/s00211-014-0673-6 10.1137/18M1182851 10.1007/s10915-018-0680-3 10.1007/s10444-011-9254-8 10.1007/s10107-015-0957-3 10.1007/s10107-017-1164-1 |
| ContentType | Journal Article |
| Copyright | The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025 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. 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 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: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025. |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1007/s10898-025-01545-x |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics Sciences (General) Computer Science |
| EISSN | 1573-2916 |
| EndPage | 831 |
| ExternalDocumentID | 10_1007_s10898_025_01545_x |
| GrantInformation_xml | – fundername: Natural Science Foundation of China grantid: 12371303 – fundername: Natural Science Foundation of Ningbo Municipality grantid: 2023J014 funderid: http://dx.doi.org/10.13039/100007834 – fundername: R&D project of Pazhou Lab grantid: 2023K0604 – fundername: Natural Science Foundation of China grantid: 12131004 – fundername: Natural Science Foundation of Zhejiang Province grantid: LZ24A010001 funderid: http://dx.doi.org/10.13039/501100004731 |
| GroupedDBID | -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 28- 29K 2J2 2JN 2JY 2KG 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 AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO ABAKF ABBBX ABBRH ABBXA ABDBE 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 ADIMF ADKNI ADKPE ADRFC ADTPH ADURQ 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 AYQZM AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU COF CS3 CSCUP D-I 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 GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IAO IHE IJ- IKXTQ ITC 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 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9M 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 SBE SCLPG SDD SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WK8 YLTOR Z45 ZMTXR ZWQNP ZY4 ~EX AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c272t-a3d2c264015145c4d4105d61a6ba24d8f4853b5a764f4c3d52a78fdd909de0f93 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001596874300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0925-5001 |
| IngestDate | Mon Nov 24 04:10:52 EST 2025 Thu Nov 27 00:57:18 EST 2025 Sun Nov 23 01:10:31 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | restarting technique Primary 65K05 saddle point problem inexact criterion Primal-dual algorithm 90C25 65K10 accelerated algorithm |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c272t-a3d2c264015145c4d4105d61a6ba24d8f4853b5a764f4c3d52a78fdd909de0f93 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-0427-8224 |
| PQID | 3274445090 |
| PQPubID | 29930 |
| PageCount | 29 |
| ParticipantIDs | proquest_journals_3274445090 crossref_primary_10_1007_s10898_025_01545_x springer_journals_10_1007_s10898_025_01545_x |
| PublicationCentury | 2000 |
| PublicationDate | 20251100 2025-11-00 20251101 |
| PublicationDateYYYYMMDD | 2025-11-01 |
| PublicationDate_xml | – month: 11 year: 2025 text: 20251100 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York – name: Dordrecht |
| PublicationSubtitle | An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering |
| PublicationTitle | Journal of global optimization |
| PublicationTitleAbbrev | J Glob Optim |
| PublicationYear | 2025 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | E Esser (1545_CR16) 2010; 3 J Liang (1545_CR35) 2022; 44 1545_CR20 R Tibshirani (1545_CR47) 2005; 67 AS Nemirovskii (1545_CR38) 1985; 25 1545_CR60 P Chen (1545_CR7) 2013; 29 F Jiang (1545_CR29) 2023; 94 L Condat (1545_CR9) 2013; 158 1545_CR2 A d’Aspremont (1545_CR11) 2021; 5 BC Vũ (1545_CR53) 2013; 38 Q Tran-Dinh (1545_CR51) 2020; 30 O Fercoq (1545_CR17) 2019; 39 F Jiang (1545_CR31) 2021; 88 1545_CR36 P Le Bodic (1545_CR34) 2018; 27 J Eckstein (1545_CR15) 2017; 68 1545_CR32 L Condat (1545_CR10) 2023; 65 D Davis (1545_CR12) 2017; 25 T Yang (1545_CR57) 2018; 19 V Roulet (1545_CR43) 2020; 30 T Valkonen (1545_CR52) 2020; 30 D Applegate (1545_CR1) 2023; 201 M Yan (1545_CR56) 2018; 76 F Jiang (1545_CR30) 2021; 90 Y Nesterov (1545_CR39) 2013; 140 B He (1545_CR23) 2022; 15 B He (1545_CR26) 2015; 130 F Shi (1545_CR45) 2015; 34 Y Zhu (1545_CR61) 2022; 32 P Chen (1545_CR8) 2016; 2016 H Oliver (1545_CR41) 2024; 57 Y Drori (1545_CR14) 2015; 43 Q Tran-Dinh (1545_CR49) 2022; 16 Y Ma (1545_CR37) 2023; 94 A Chambolle (1545_CR5) 2011; 40 M Ito (1545_CR28) 2021; 188 A Chambolle (1545_CR6) 2016; 159 B He (1545_CR25) 2012; 50 J Rasch (1545_CR42) 2020; 76 J Bai (1545_CR3) 2025; 102 LM Briceno-Arias (1545_CR4) 2011; 21 B He (1545_CR24) 2012; 5 B O’donoghue (1545_CR40) 2015; 15 AS Schulz (1545_CR44) 2002; 27 A Torrico (1545_CR48) 2021; 33 K Wang (1545_CR55) 2023; 69 BS He (1545_CR27) 2015; 7 1545_CR58 1545_CR59 D Han (1545_CR22) 2014; 127 1545_CR13 Q Tran-Dinh (1545_CR50) 2018; 28 P Latafat (1545_CR33) 2017; 68 K Wang (1545_CR54) 2020; 85 1545_CR19 RM Freund (1545_CR18) 2018; 170 W Su (1545_CR46) 2016; 17 EY Hamedani (1545_CR21) 2021; 31 |
| References_xml | – volume: 7 start-page: 2526 year: 2015 ident: 1545_CR27 publication-title: SIAM J. Imaging Sci. doi: 10.1137/140963467 – volume: 65 start-page: 375 issue: 2 year: 2023 ident: 1545_CR10 publication-title: SIAM Rev. doi: 10.1137/20M1379344 – volume: 76 start-page: 381 issue: 2 year: 2020 ident: 1545_CR42 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-020-00186-y – volume: 32 start-page: 2580 issue: 4 year: 2022 ident: 1545_CR61 publication-title: SIAM J. Optim. doi: 10.1137/21M1408683 – volume: 102 start-page: 80 issue: 3 year: 2025 ident: 1545_CR3 publication-title: J. Sci. Comput. doi: 10.1007/s10915-025-02802-7 – volume: 30 start-page: 262 issue: 1 year: 2020 ident: 1545_CR43 publication-title: SIAM J. Optim. doi: 10.1137/18M1224568 – volume: 69 start-page: 3693 issue: 5 year: 2023 ident: 1545_CR55 publication-title: J. Appl. Math. Comput. doi: 10.1007/s12190-023-01899-z – volume: 68 start-page: 363 issue: 2 year: 2017 ident: 1545_CR15 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-017-9911-z – volume: 201 start-page: 133 issue: 1–2 year: 2023 ident: 1545_CR1 publication-title: Math. Program. doi: 10.1007/s10107-022-01901-9 – ident: 1545_CR59 – ident: 1545_CR60 – ident: 1545_CR13 doi: 10.1109/ICASSP40776.2020.9053722 – ident: 1545_CR36 – volume: 40 start-page: 120 year: 2011 ident: 1545_CR5 publication-title: J. Math. Imaging Vis. doi: 10.1007/s10851-010-0251-1 – ident: 1545_CR32 – volume: 34 start-page: 2459 issue: 12 year: 2015 ident: 1545_CR45 publication-title: IEEE Trans. Med. Imaging doi: 10.1109/TMI.2015.2437894 – volume: 33 start-page: 1590 issue: 4 year: 2021 ident: 1545_CR48 publication-title: INFORMS J. Comput. – volume: 19 start-page: 236 issue: 1 year: 2018 ident: 1545_CR57 publication-title: J. Mach. Learn. Res. – volume: 21 start-page: 1230 issue: 4 year: 2011 ident: 1545_CR4 publication-title: SIAM J. Optim. doi: 10.1137/10081602X – volume: 16 start-page: 1235 issue: 4 year: 2022 ident: 1545_CR49 publication-title: Optim. Lett. doi: 10.1007/s11590-021-01775-4 – volume: 30 start-page: 2866 issue: 4 year: 2020 ident: 1545_CR51 publication-title: SIAM J. Optim. doi: 10.1137/19M1293855 – volume: 44 start-page: A1069 issue: 3 year: 2022 ident: 1545_CR35 publication-title: SIAM J. Sci. Comput. doi: 10.1137/21M1395685 – volume: 25 start-page: 21 issue: 2 year: 1985 ident: 1545_CR38 publication-title: USSR Comput. Math. Math. Phys. doi: 10.1016/0041-5553(85)90100-4 – volume: 25 start-page: 829 year: 2017 ident: 1545_CR12 publication-title: Set-Valued Var. Anal. doi: 10.1007/s11228-017-0421-z – ident: 1545_CR2 doi: 10.1137/1.9781611973402.110 – volume: 88 start-page: 1109 year: 2021 ident: 1545_CR31 publication-title: Numer. Algorithms doi: 10.1007/s11075-021-01069-x – volume: 43 start-page: 209 issue: 2 year: 2015 ident: 1545_CR14 publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2015.02.001 – volume: 188 start-page: 770 year: 2021 ident: 1545_CR28 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-020-01806-7 – volume: 67 start-page: 91 year: 2005 ident: 1545_CR47 publication-title: J. Roy. Statist. Soc. Ser. B doi: 10.1111/j.1467-9868.2005.00490.x – volume: 127 start-page: 167 year: 2014 ident: 1545_CR22 publication-title: Numer. Math. doi: 10.1007/s00211-013-0580-2 – ident: 1545_CR20 – volume: 50 start-page: 700 year: 2012 ident: 1545_CR25 publication-title: SIAM J. Numer. Anal. doi: 10.1137/110836936 – volume: 57 year: 2024 ident: 1545_CR41 publication-title: Oper. Res. Lett. doi: 10.1016/j.orl.2024.107199 – volume: 17 start-page: 1 year: 2016 ident: 1545_CR46 publication-title: J. Mach. Learn. Res. – volume: 90 start-page: 1227 issue: 329 year: 2021 ident: 1545_CR30 publication-title: Math. Comput. doi: 10.1090/mcom/3610 – volume: 3 start-page: 1015 year: 2010 ident: 1545_CR16 publication-title: SIAM J. Imaging Sci. doi: 10.1137/09076934X – volume: 15 start-page: 1157 issue: 3 year: 2022 ident: 1545_CR23 publication-title: SIAM J. Imaging Sci. doi: 10.1137/21M1453463 – volume: 15 start-page: 715 year: 2015 ident: 1545_CR40 publication-title: Found. Comput. Math. doi: 10.1007/s10208-013-9150-3 – volume: 94 start-page: 479 year: 2023 ident: 1545_CR29 publication-title: Numer. Algorithms doi: 10.1007/s11075-023-01509-w – volume: 27 start-page: 681 issue: 4 year: 2002 ident: 1545_CR44 publication-title: Math. Oper. Res. doi: 10.1287/moor.27.4.681.305 – ident: 1545_CR58 doi: 10.1007/s40305-024-00568-7 – volume: 29 issue: 2 year: 2013 ident: 1545_CR7 publication-title: Inverse Probl. doi: 10.1088/0266-5611/29/2/025011 – volume: 68 start-page: 57 year: 2017 ident: 1545_CR33 publication-title: Comput. Optim. Appl. doi: 10.1007/s10589-017-9909-6 – volume: 5 start-page: 119 year: 2012 ident: 1545_CR24 publication-title: SIAM J. Imaging Sci. doi: 10.1137/100814494 – volume: 94 start-page: 60 issue: 3 year: 2023 ident: 1545_CR37 publication-title: J. Sci. Comput. doi: 10.1007/s10915-023-02105-9 – volume: 140 start-page: 125 issue: 1 year: 2013 ident: 1545_CR39 publication-title: Math. Program. doi: 10.1007/s10107-012-0629-5 – volume: 5 start-page: 1 issue: 1–2 year: 2021 ident: 1545_CR11 publication-title: Acceleration methods. Found. Trends Optim. – volume: 39 start-page: 2069 issue: 4 year: 2019 ident: 1545_CR17 publication-title: IMA J. Numer. Anal. doi: 10.1093/imanum/drz007 – ident: 1545_CR19 doi: 10.1109/CDC.2014.7040179 – volume: 158 start-page: 460 issue: 2 year: 2013 ident: 1545_CR9 publication-title: J. Optim. Theory Appl. doi: 10.1007/s10957-012-0245-9 – volume: 27 start-page: 1 year: 2018 ident: 1545_CR34 publication-title: Discrete Optim. doi: 10.1016/j.disopt.2017.08.004 – volume: 31 start-page: 1299 issue: 2 year: 2021 ident: 1545_CR21 publication-title: SIAM J. Optim. doi: 10.1137/18M1213488 – volume: 28 start-page: 96 issue: 1 year: 2018 ident: 1545_CR50 publication-title: SIAM J. Optim. doi: 10.1137/16M1093094 – volume: 85 start-page: 30 issue: 2 year: 2020 ident: 1545_CR54 publication-title: J. Sci. Comput. doi: 10.1007/s10915-020-01330-w – volume: 2016 start-page: 1 issue: 1 year: 2016 ident: 1545_CR8 publication-title: Fixed Point Theory Appl. doi: 10.1186/s13663-016-0543-2 – volume: 130 start-page: 567 issue: 3 year: 2015 ident: 1545_CR26 publication-title: Numer. Math. doi: 10.1007/s00211-014-0673-6 – volume: 30 start-page: 1391 issue: 2 year: 2020 ident: 1545_CR52 publication-title: SIAM J. Optim. doi: 10.1137/18M1182851 – volume: 76 start-page: 1698 year: 2018 ident: 1545_CR56 publication-title: J. Sci. Comput. doi: 10.1007/s10915-018-0680-3 – volume: 38 start-page: 667 issue: 3 year: 2013 ident: 1545_CR53 publication-title: Adv. Comput. Math. doi: 10.1007/s10444-011-9254-8 – volume: 159 start-page: 253 issue: 1–2 year: 2016 ident: 1545_CR6 publication-title: Math. Program. doi: 10.1007/s10107-015-0957-3 – volume: 170 start-page: 445 year: 2018 ident: 1545_CR18 publication-title: Math. Program. doi: 10.1007/s10107-017-1164-1 |
| SSID | ssj0009852 |
| Score | 2.4355824 |
| Snippet | In this paper, we are concerned with a class of convex-concave saddle point problems, where one of the objective parts is assumed to be a convex and smooth... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 803 |
| SubjectTerms | Algorithms Computer Science Convex analysis Euclidean space Lipschitz condition Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Real Functions Saddle points |
| Subtitle | Practical proximal primal-dual algorithms for structured saddle point problems |
| Title | Practical proximal primal-dual algorithms for structured saddle point problems |
| URI | https://link.springer.com/article/10.1007/s10898-025-01545-x https://www.proquest.com/docview/3274445090 |
| Volume | 93 |
| WOSCitedRecordID | wos001596874300001&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 Contemporary 1997-Present customDbUrl: eissn: 1573-2916 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009852 issn: 0925-5001 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/eLvHCXMwnV07T8MwED6hwgADpQVEoSAPDCCIlLrOwyNCIBYqxEvdIscPqEQfagLi53NOHFIQDDAlUU5Wcmf7O9t33wEc0pQjqEocSL6MPCap9rg2zEt1KLkFmNg3RbGJaDCIh0N-45LCsiravTqSLGbqhWS32KaDURtshrjvoee4bMlLbN2C27vHmmo3Lurs-BwlA5yFXarMz218haPax_x2LFqgzWXzf9-5AevOuyRnZXdowZKetKFZVW4gbiC3YW2BhhCfrj-5W7M2tJxURo4cJ_XxJgxKXiM0KLGBL6NxcWMvnk3mIuLlaTof5c_jjKAXTEpW2te5ViQTdgeEzKajSU5c-ZpsCx4uL-7PrzxXisGTNKK5J_qKSvSd8I96LJBM2ehQFfZEmArKVGwYwn4aiChkhsm-CqiIYqMU97nSvuH9bWhMphO9A4TpUAhcxzCTCvTV0IAmwjWi4ZxqBA7VgZPKIsmsZNxIam5lq9sEdZsUuk3eO9CtjJa40ZclfUt7yLBpvwOnlZHq17-3tvs38T1YpdbORWpiFxqoW70PK_ItH2Xzg6JXfgCKF90F |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED9kCuqDH1NxOjUPPiha6NKsbR5FHBPdEJ2yt5LmQwduk3WKf76XLnVT9EGf2tIQ2rskv7vk7ncAhzTlCKoSJ5IvI49Jqj2uDfNSHUpuASb2TV5sImq3426X37iksKyIdi-OJPOVeibZLbbpYNQGmyHue2g5zjNaC-y4vr17mFLtxnmdHZ9jyzquwi5V5uc-vsLR1Mb8diyao01j9X_fuQYrzrokZ5PhsA5zelCG1aJyA3ETuQzLMzSE-NT65G7NyrDuWmXkyHFSH29Ae8JrhAolNvCl189v7MWzyVxEPD8OR73xUz8jaAWTCSvt60grkgm7A0Jehr3BmLjyNdkm3DcuOudNz5Vi8CSN6NgTgaISbSf8oxqrS6ZsdKgKayJMBWUqNgxhP62LKGSGyUDVqYhioxT3udK-4cEWlAbDgd4GwnQoBPoxzKQCbTV0oUyEPqLhnGoEDlWBk0IjycuEcSOZcitb2SYo2ySXbfJegWqhtMTNviwJLO0hw679CpwWSpq-_r23nb81P4DFZqd1nVxftq92YYlanedpilUooZz1HizIt3EvG-3nI_QD70rf6Q |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB5ERfRgbVWsVt2DB0WDcbtNskdRi6KWgg96C5t9aMGmpYniz3c2D1tFD-IpCRmWZGY380125huAPRpxdKoSF5IrfYdJqh2uDXMi7UluHUzgmqzZhN_pBL0e705V8WfZ7uWWZF7TYFma4vR4pMzxVOFbYEvDqE08QwzgIIqcY5YNzcbrd48T2t0g67njcpRs4Re5KJv5eYyvrmmCN79tkWaep135_zOvwHKBOslpPk2qMKPjGlTKjg6kWOA1WJqiJ8Sr209O16QG1UIqIfsFV_XBKnRyviM0NLEJMf1BdmIPji3yIuLlaTjup8-DhCA6Jjlb7etYK5II-2eEjIb9OCVFW5tkDR7aF_dnl07RosGR1KepI5qKSsRU-EYnrCWZslmjyjsRXiQoU4FhCAeilvA9ZphsqhYVfmCU4i5X2jW8uQ6z8TDWG0CY9oTA-IaZSCCGw9DK-Bg7Gs6pRoei6nBYWicc5Uwc4YRz2eo2RN2GmW7D9zo0SgOGxapMwqalQ2Q4tFuHo9Jgk9u_j7b5N_FdWOiet8Obq871FixSa_KserEBs6hmvQ3z8i3tJ-OdbLJ-AC-H6M0 |
| 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=Practical+proximal+primal-dual+algorithms+for+structured+saddle+point+problems&rft.jtitle=Journal+of+global+optimization&rft.au=Qu%2C+Yunfei&rft.au=He%2C+Hongjin&rft.au=Zhang%2C+Tao&rft.au=Han%2C+Deren&rft.date=2025-11-01&rft.pub=Springer+US&rft.issn=0925-5001&rft.eissn=1573-2916&rft.volume=93&rft.issue=3&rft.spage=803&rft.epage=831&rft_id=info:doi/10.1007%2Fs10898-025-01545-x&rft.externalDocID=10_1007_s10898_025_01545_x |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5001&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5001&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5001&client=summon |