Distributed Discrete-Time Convex Optimization With Closed Convex Set Constraints: Linearly Convergent Algorithm Design

The convergence rate and applicability to directed graphs with interaction topologies are two important features for practical applications of distributed optimization algorithms. In this article, a new kind of fast distributed discrete-time algorithms is developed for solving convex optimization pr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on cybernetics Jg. 54; H. 4; S. 2271 - 2283
Hauptverfasser: Luan, Meng, Wen, Guanghui, Liu, Hongzhe, Huang, Tingwen, Chen, Guanrong, Yu, Wenwu
Format: Journal Article
Sprache:Englisch
Veröffentlicht: United States IEEE 01.04.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
ISSN:2168-2267, 2168-2275, 2168-2275
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The convergence rate and applicability to directed graphs with interaction topologies are two important features for practical applications of distributed optimization algorithms. In this article, a new kind of fast distributed discrete-time algorithms is developed for solving convex optimization problems with closed convex set constraints over directed interaction networks. Under the gradient tracking framework, two distributed algorithms are, respectively, designed over balanced and unbalanced graphs, where momentum terms and two time-scales are involved. Furthermore, it is demonstrated that the designed distributed algorithms attain linear speedup convergence rates provided that the momentum coefficients and the step size are appropriately selected. Finally, numerical simulations verify the effectiveness and the global accelerated effect of the designed algorithms.
AbstractList The convergence rate and applicability to directed graphs with interaction topologies are two important features for practical applications of distributed optimization algorithms. In this article, a new kind of fast distributed discrete-time algorithms is developed for solving convex optimization problems with closed convex set constraints over directed interaction networks. Under the gradient tracking framework, two distributed algorithms are, respectively, designed over balanced and unbalanced graphs, where momentum terms and two time-scales are involved. Furthermore, it is demonstrated that the designed distributed algorithms attain linear speedup convergence rates provided that the momentum coefficients and the step size are appropriately selected. Finally, numerical simulations verify the effectiveness and the global accelerated effect of the designed algorithms.The convergence rate and applicability to directed graphs with interaction topologies are two important features for practical applications of distributed optimization algorithms. In this article, a new kind of fast distributed discrete-time algorithms is developed for solving convex optimization problems with closed convex set constraints over directed interaction networks. Under the gradient tracking framework, two distributed algorithms are, respectively, designed over balanced and unbalanced graphs, where momentum terms and two time-scales are involved. Furthermore, it is demonstrated that the designed distributed algorithms attain linear speedup convergence rates provided that the momentum coefficients and the step size are appropriately selected. Finally, numerical simulations verify the effectiveness and the global accelerated effect of the designed algorithms.
The convergence rate and applicability to directed graphs with interaction topologies are two important features for practical applications of distributed optimization algorithms. In this article, a new kind of fast distributed discrete-time algorithms is developed for solving convex optimization problems with closed convex set constraints over directed interaction networks. Under the gradient tracking framework, two distributed algorithms are, respectively, designed over balanced and unbalanced graphs, where momentum terms and two time-scales are involved. Furthermore, it is demonstrated that the designed distributed algorithms attain linear speedup convergence rates provided that the momentum coefficients and the step size are appropriately selected. Finally, numerical simulations verify the effectiveness and the global accelerated effect of the designed algorithms.
Author Huang, Tingwen
Luan, Meng
Wen, Guanghui
Yu, Wenwu
Liu, Hongzhe
Chen, Guanrong
Author_xml – sequence: 1
  givenname: Meng
  surname: Luan
  fullname: Luan, Meng
  email: 230228433@seu.edu.cn
  organization: Department of Systems Science, School of Mathematics, Southeast University, Nanjing, China
– sequence: 2
  givenname: Guanghui
  orcidid: 0000-0003-0070-8597
  surname: Wen
  fullname: Wen, Guanghui
  email: wenguanghui@gmail.com
  organization: Department of Systems Science, School of Mathematics, Southeast University, Nanjing, China
– sequence: 3
  givenname: Hongzhe
  orcidid: 0000-0002-6887-368X
  surname: Liu
  fullname: Liu, Hongzhe
  email: 101300130@seu.edu.cn
  organization: Department of Systems Science, School of Mathematics, Southeast University, Nanjing, China
– sequence: 4
  givenname: Tingwen
  orcidid: 0000-0001-9610-846X
  surname: Huang
  fullname: Huang, Tingwen
  email: tingwen.huang@qatar.tamu.edu
  organization: Department of Science, Texas A&M University at Qatar, Doha, Qatar
– sequence: 5
  givenname: Guanrong
  orcidid: 0000-0003-1381-7418
  surname: Chen
  fullname: Chen, Guanrong
  email: eegchen@cityu.edu.hk
  organization: Department of Electrical Engineering, City University of Hong Kong, Hong Kong, China
– sequence: 6
  givenname: Wenwu
  orcidid: 0000-0001-6406-2399
  surname: Yu
  fullname: Yu, Wenwu
  email: wwyu@seu.edu.cn
  organization: Department of Systems Science, School of Mathematics, Southeast University, Nanjing, China
BackLink https://www.ncbi.nlm.nih.gov/pubmed/37159318$$D View this record in MEDLINE/PubMed
BookMark eNp9kU1v1DAQhi1UREvpD0BCKBIXLln8kcQ2t5KWD2mlHliEOFle73hxldhb26kov74Ou1SoB3zxjP28Y8-8z9GRDx4QeknwghAs3636Hx8WFFO2YJRjIton6ISSTtSU8vboIe74MTpL6RqXJcqRFM_QMeOklYyIE3R74VKObj1l2FQlNhEy1Cs3QtUHfwu_qqtddqP7rbMLvvru8s-qH0Iq9OH-K-Q5LFW08zm9r5bOg47D3R6IW_C5Oh-2IRbtWF1Aclv_Aj21ekhwdthP0bePl6v-c728-vSlP1_WhrU414xCq2VrqWm0abgFbi0AaYAzgYGUtOs21BgJDbUgLJZWNkS3uJkbXBt2it7u6-5iuJkgZTWWHmEYtIcwJUUFIZJxzkhB3zxCr8MUffmdorKTuMFYskK9PlDTeoSN2kU36nin_k60AGQPmBhSimAfEILVbJyajVOzcepgXNHwRxrj8p-Bz0Md_qt8tVc6APjnJUIpaQS7BxDTpgk
CODEN ITCEB8
CitedBy_id crossref_primary_10_1002_asjc_3287
crossref_primary_10_1002_rnc_7926
crossref_primary_10_3390_drones9010036
crossref_primary_10_1109_TSMC_2025_3534629
crossref_primary_10_1109_TII_2024_3378839
crossref_primary_10_1109_TCYB_2024_3440349
Cites_doi 10.1109/TII.2019.2945601
10.1109/TIP.2017.2681840
10.1137/14096668X
10.1137/16M1084316
10.1109/TAC.2020.2969721
10.1109/TAC.2019.2912494
10.1016/j.arcontrol.2019.05.006
10.1109/TCYB.2021.3080818
10.1109/TCYB.2017.2728644
10.1016/0041-5553(64)90137-5
10.1109/TAC.2015.2416927
10.1016/j.automatica.2018.07.020
10.1109/TAC.2010.2041686
10.1109/TAC.2017.2681200
10.1109/LCSYS.2018.2834316
10.1017/CBO9781139020411
10.1109/TCYB.2020.3022240
10.1137/070708111
10.1109/TSG.2014.2388357
10.1186/s13634-018-0596-y
10.1007/s11432-016-9114-y
10.1016/j.automatica.2022.110403
10.1109/TSG.2011.2151888
10.1109/tcyb.2021.3127278
10.1109/TAC.2008.2009515
10.1016/j.automatica.2021.109899
10.1109/TAC.2017.2737582
10.1007/s10107-020-01487-0
10.1109/ECC.2015.7330562
10.1137/130943170
10.1109/TAC.2005.846556
10.1109/TCNS.2017.2698261
10.1109/TAC.2014.2298712
10.1109/TSG.2015.2409053
10.1109/TAC.2011.2167817
10.1109/TCYB.2019.2895885
10.1109/TAC.2019.2937496
10.1109/TAC.2019.2942513
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2024
DBID 97E
RIA
RIE
AAYXX
CITATION
NPM
7SC
7SP
7TB
8FD
F28
FR3
H8D
JQ2
L7M
L~C
L~D
7X8
DOI 10.1109/TCYB.2023.3270185
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
PubMed
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
Aerospace Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
DatabaseTitle CrossRef
PubMed
Aerospace Database
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Computer and Information Systems Abstracts Professional
MEDLINE - Academic
DatabaseTitleList MEDLINE - Academic

PubMed
Aerospace Database
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 2
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
– sequence: 3
  dbid: 7X8
  name: MEDLINE - Academic
  url: https://search.proquest.com/medline
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Sciences (General)
EISSN 2168-2275
EndPage 2283
ExternalDocumentID 37159318
10_1109_TCYB_2023_3270185
10122148
Genre orig-research
Journal Article
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: U22B2046; 62073079; 62088101; 62233004; 62203110
  funderid: 10.13039/501100001809
– fundername: General Joint Fund of the Equipment Advance Research Program of Ministry of Education
  grantid: 8091B022114
– fundername: Fundamental Research Funds for the Central Universities
  grantid: 2242022R20031
  funderid: 10.13039/501100012226
– fundername: National Key Research and Development Program of China
  grantid: 2022YFA1004702
GroupedDBID 0R~
4.4
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
AENEX
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
HZ~
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
PQQKQ
RIA
RIE
RNS
AAYXX
CITATION
NPM
7SC
7SP
7TB
8FD
F28
FR3
H8D
JQ2
L7M
L~C
L~D
7X8
ID FETCH-LOGICAL-c350t-32e5a95f2c4ac47fe7ffee14e7380e1e7f66d2cc9e42fe8f09f941a5047159bc3
IEDL.DBID RIE
ISICitedReferencesCount 11
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000992281100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2168-2267
2168-2275
IngestDate Sat Sep 27 23:19:31 EDT 2025
Mon Jun 30 05:15:30 EDT 2025
Thu Apr 03 07:06:07 EDT 2025
Tue Nov 18 21:29:48 EST 2025
Sat Nov 29 02:02:39 EST 2025
Wed Aug 27 03:03:27 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c350t-32e5a95f2c4ac47fe7ffee14e7380e1e7f66d2cc9e42fe8f09f941a5047159bc3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ORCID 0000-0002-6887-368X
0000-0001-6406-2399
0000-0001-9610-846X
0000-0003-1381-7418
0000-0003-0070-8597
PMID 37159318
PQID 2969040093
PQPubID 85422
PageCount 13
ParticipantIDs pubmed_primary_37159318
crossref_citationtrail_10_1109_TCYB_2023_3270185
proquest_miscellaneous_2811937731
ieee_primary_10122148
crossref_primary_10_1109_TCYB_2023_3270185
proquest_journals_2969040093
PublicationCentury 2000
PublicationDate 2024-04-01
PublicationDateYYYYMMDD 2024-04-01
PublicationDate_xml – month: 04
  year: 2024
  text: 2024-04-01
  day: 01
PublicationDecade 2020
PublicationPlace United States
PublicationPlace_xml – name: United States
– name: Piscataway
PublicationTitle IEEE transactions on cybernetics
PublicationTitleAbbrev TCYB
PublicationTitleAlternate IEEE Trans Cybern
PublicationYear 2024
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref35
ref12
ref34
ref15
ref37
ref14
ref36
ref31
ref30
ref11
ref33
ref10
ref32
ref2
ref1
ref17
ref16
ref38
ref19
ref18
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref29
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref14
  doi: 10.1109/TII.2019.2945601
– ident: ref4
  doi: 10.1109/TIP.2017.2681840
– ident: ref17
  doi: 10.1137/14096668X
– ident: ref22
  doi: 10.1137/16M1084316
– ident: ref27
  doi: 10.1109/TAC.2020.2969721
– ident: ref15
  doi: 10.1109/TAC.2019.2912494
– ident: ref1
  doi: 10.1016/j.arcontrol.2019.05.006
– ident: ref6
  doi: 10.1109/TCYB.2021.3080818
– ident: ref3
  doi: 10.1109/TCYB.2017.2728644
– ident: ref37
  doi: 10.1016/0041-5553(64)90137-5
– ident: ref36
  doi: 10.1109/TAC.2015.2416927
– ident: ref7
  doi: 10.1016/j.automatica.2018.07.020
– ident: ref10
  doi: 10.1109/TAC.2010.2041686
– ident: ref12
  doi: 10.1109/TAC.2017.2681200
– ident: ref26
  doi: 10.1109/LCSYS.2018.2834316
– ident: ref34
  doi: 10.1017/CBO9781139020411
– ident: ref29
  doi: 10.1109/TCYB.2020.3022240
– ident: ref9
  doi: 10.1137/070708111
– ident: ref16
  doi: 10.1109/TSG.2014.2388357
– ident: ref28
  doi: 10.1186/s13634-018-0596-y
– ident: ref30
  doi: 10.1007/s11432-016-9114-y
– ident: ref20
  doi: 10.1016/j.automatica.2022.110403
– ident: ref31
  doi: 10.1109/TSG.2011.2151888
– ident: ref5
  doi: 10.1109/tcyb.2021.3127278
– ident: ref35
  doi: 10.1109/TAC.2008.2009515
– ident: ref13
  doi: 10.1016/j.automatica.2021.109899
– ident: ref24
  doi: 10.1109/TAC.2017.2737582
– ident: ref23
  doi: 10.1007/s10107-020-01487-0
– ident: ref38
  doi: 10.1109/ECC.2015.7330562
– ident: ref19
  doi: 10.1137/130943170
– ident: ref33
  doi: 10.1109/TAC.2005.846556
– ident: ref21
  doi: 10.1109/TCNS.2017.2698261
– ident: ref32
  doi: 10.1109/TAC.2014.2298712
– ident: ref2
  doi: 10.1109/TSG.2015.2409053
– ident: ref11
  doi: 10.1109/TAC.2011.2167817
– ident: ref8
  doi: 10.1109/TCYB.2019.2895885
– ident: ref18
  doi: 10.1109/TAC.2019.2937496
– ident: ref25
  doi: 10.1109/TAC.2019.2942513
SSID ssj0000816898
Score 2.41576
Snippet The convergence rate and applicability to directed graphs with interaction topologies are two important features for practical applications of distributed...
SourceID proquest
pubmed
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 2271
SubjectTerms Algorithms
Computational geometry
Consensus
Consensus algorithm
Convergence
Convex functions
Convexity
directed interaction topology
distributed constrained optimization
Eigenvalues and eigenfunctions
gradient tracking
Graph theory
Graphs
linear convergence rate
Momentum
Network topology
Numerical simulation
Optimization
Topology
Title Distributed Discrete-Time Convex Optimization With Closed Convex Set Constraints: Linearly Convergent Algorithm Design
URI https://ieeexplore.ieee.org/document/10122148
https://www.ncbi.nlm.nih.gov/pubmed/37159318
https://www.proquest.com/docview/2969040093
https://www.proquest.com/docview/2811937731
Volume 54
WOSCitedRecordID wos000992281100001&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: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 2168-2275
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816898
  issn: 2168-2267
  databaseCode: RIE
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Rb9QwDI7YhNBegMGAgzEFiQdA6i1N0qbhbdyYeBpIDHE8VW3iwKTbFV17Ez8fO82d9jIk3lzVadPaiZ3E9sfYa-eCU21bZAJyn2krBI457zJf2ray0vs29xFswpyfV_O5_ZKS1WMuDADE4DOYEhnP8n3n1rRVdky1qCT67ztsx5hyTNbabqhEBImIfSuRyNCtMOkUMxf2-GL248OUoMKnShqBRmqP3VMGbbkiuI8bJilirNzubkazc_bgPzv8kN1P_iU_GRVin92B5SO2n0Zwz9-kMtNvH7PrU6qZS3BX4DnS6D4OkFFKCJ9RKPof_hmnk6uUp8m_Xw6_-GzR9cid7n-Fgcg-wkwM_XuOC1uggskjA6V1Dvxk8bNbYdsrfhqDRQ7Yt7OPF7NPWUJhyJwqxJApCUVjiyCdbpw2AUwIALkGoyoUMF6WpZfOWdAyQBWEDVbnTSE0_d7WqSdsd9kt4RnjuQuF0laVumo1akjlgY5VK1pXhdCoCRMbQdQulSinT1jUcakibE1irEmMdRLjhL3bNvk91uf4F_MByegG4yieCTvciLtOQ7ivpS0tzXAWu_VqexsHH52oNEvo1shT5egAG6PyCXs6qsn24Rvten7LS1-wPexbigI6ZLvDag0v2V13PVz2qyPU8Hl1FDX8L2-X9ZU
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3db9MwELdgINgLMBhQGGAkHgApnWM7H-ZtdExDjIJE0cZT1NjnbVLXoCad-PO5c9xqL0PizVHOiZO7s8--jx9jb6z1VtV1lghIXaKNEKhzziYuN3VppHN16gLYRDEelycn5ntMVg-5MAAQgs9gSM3gy3eNXdJR2S7VopJov99ktzKtpejTtdZHKgFDIqDfSmwkaFgU0Y-ZCrM7Gf36OCSw8KGShcBlapPdUQWu5ooAP64sSgFl5XqDMyw8B_f_c8gP2L1oYfK9XiS22A2YP2RbUYdb_jYWmn73iF3uU9VcArwCx7GNBmQHCSWF8BEFo__h33BCuYiZmvz4vDvjo1nTInW8_wM6arYBaKJrP3Dc2gKVTO4JKLGz43uz02aBfS_4fggX2WY_Dz5NRodJxGFIrMpElygJ2dRkXlo9tbrwUHgPkGooVIksxss8d9JaA1p6KL0w3uh0mglNv7e26jHbmDdzeMp4an2mtFG5LmuNMlI6IMdqSTsr76dqwMSKEZWNRcrpE2ZV2KwIUxEbK2JjFdk4YO_XXX73FTr-RbxNPLpC2LNnwHZW7K6iEreVNLmhOc7gsF6vb6P6kU9lOodmiTRliiZwUah0wJ70YrJ--Eq6nl3z0lfs7uHk61F19Hn85TnbxHHGmKAdttEtlvCC3baX3Xm7eBnk_C-QR_f0
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=Distributed+Discrete-Time+Convex+Optimization+With+Closed+Convex+Set+Constraints%3A+Linearly+Convergent+Algorithm+Design&rft.jtitle=IEEE+transactions+on+cybernetics&rft.au=Meng+Luan&rft.au=Wen%2C+Guanghui&rft.au=Liu%2C+Hongzhe&rft.au=Huang%2C+Tingwen&rft.date=2024-04-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=2168-2267&rft.eissn=2168-2275&rft.volume=54&rft.issue=4&rft.spage=2271&rft_id=info:doi/10.1109%2FTCYB.2023.3270185&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2168-2267&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2168-2267&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2168-2267&client=summon