An approximate gradient algorithm for constrained distributed convex optimization

In this paper, we propose an approximate gradient algorithm for the multi-agent convex optimization problem with constraints. The agents cooperatively compute the minimum of the sum of the local objective functions which are subject to a global inequality constraint and a global constraint set. Inst...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/CAA journal of automatica sinica Ročník 1; číslo 1; s. 61 - 67
Hlavní autoři: Zhang, Yanqiong, Lou, Youcheng, Hong, Yiguang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Chinese Association of Automation (CAA) 01.01.2014
Témata:
Algorithm design and analysis
approximate gradient
Approximation algorithms
Constraints
Convex functions
distributed optimization
Linear programming
Multi-agent systems
Optimization
ISSN:2329-9266, 2329-9274
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 In this paper, we propose an approximate gradient algorithm for the multi-agent convex optimization problem with constraints. The agents cooperatively compute the minimum of the sum of the local objective functions which are subject to a global inequality constraint and a global constraint set. Instead of each agent can get exact gradient, as discussed in the literature, we only use approximate gradient with some computation or measurement errors. The gradient accuracy conditions are presented to ensure the convergence of the approximate gradient algorithm. Finally, simulation results demonstrate good performance of the approximate algorithm.
AbstractList In this paper, we propose an approximate gradient algorithm for the multi-agent convex optimization problem with constraints. The agents cooperatively compute the minimum of the sum of the local objective functions which are subject to a global inequality constraint and a global constraint set. Instead of each agent can get exact gradient, as discussed in the literature, we only use approximate gradient with some computation or measurement errors. The gradient accuracy conditions are presented to ensure the convergence of the approximate gradient algorithm. Finally, simulation results demonstrate good performance of the approximate algorithm.
Author Hong, Yiguang
Zhang, Yanqiong
Lou, Youcheng
Author_xml – sequence: 1
  givenname: Yanqiong
  surname: Zhang
  fullname: Zhang, Yanqiong
  email: yanqiong918@163.com
  organization: Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China
– sequence: 2
  givenname: Youcheng
  surname: Lou
  fullname: Lou, Youcheng
  email: louyoucheng@amss.ac.cn
  organization: National Center for Mathematics and Interdisciplinary Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China
– sequence: 3
  givenname: Yiguang
  surname: Hong
  fullname: Hong, Yiguang
  email: yghong@iss.ac.cn
  organization: Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China
BookMark eNp9kE9LAzEQxYNUsNbeBS_5ArtOstkkeyzFvxRE1POSTbI10iZLNkr107u1tQcPnuYxM7_hzTtFIx-8ReicQE4IVJf3s6ecAmG5AGCckiM0pgWtsooKNjpozk_QtO_fAIDQUvCKjdHjzGPVdTFs3Foli5dRGWd9wmq1DNGl1zVuQ8Q6-D5F5bw12LhBuuY9DXrof9gNDl1ya_elkgv-DB23atXb6b5O0Mv11fP8Nls83NzNZ4tMEyFT1khJDRVaiZJX2oKRUkuw0NBWlVoUjBVMcGJt1RrdCiWNLE1ZiIZIEFyoYoL47q6Ooe-jbWvt0o-DrdFVTaDeZlMP2dTbbOp9NgMIf8AuDs_Hz_-Qix3irLWH9d_pNyRwcqU
CODEN IJASJC
CitedBy_id crossref_primary_10_1016_j_oceaneng_2021_110507
crossref_primary_10_1016_j_jfranklin_2022_05_041
crossref_primary_10_1109_JAS_2022_105923
crossref_primary_10_1016_j_sigpro_2025_110275
crossref_primary_10_1109_TCYB_2015_2478486
crossref_primary_10_1109_TSIPN_2024_3402354
crossref_primary_10_1109_JAS_2022_105992
crossref_primary_10_1007_s10957_021_01840_z
crossref_primary_10_1109_TSMC_2025_3534629
crossref_primary_10_3390_s21134370
crossref_primary_10_1109_JAS_2024_124656
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/JAS.2014.7004621
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE/IET Electronic Library (IEL)
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2329-9274
EndPage 67
ExternalDocumentID 10_1109_JAS_2014_7004621
7004621
Genre orig-research
GroupedDBID -0I
-0Y
-SI
-S~
0R~
4.4
5VR
6IK
92M
97E
9D9
9DI
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
AFUIB
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CAJEI
EBS
EJD
IFIPE
IPLJI
JAVBF
M43
O9-
OCL
PQQKQ
Q--
RIA
RIE
RT9
T8Y
TCJ
TGT
U1F
U1G
U5I
U5S
AAYXX
CITATION
ID FETCH-LOGICAL-c178t-b882d27ca7569ce0d88c80e0b2fa5c734434761ee9fdcf7a8d85d537b180767a3
IEDL.DBID RIE
ISSN 2329-9266
IngestDate Sat Nov 29 03:31:01 EST 2025
Tue Nov 18 20:44:35 EST 2025
Wed Aug 27 02:20:43 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c178t-b882d27ca7569ce0d88c80e0b2fa5c734434761ee9fdcf7a8d85d537b180767a3
PageCount 7
ParticipantIDs crossref_primary_10_1109_JAS_2014_7004621
ieee_primary_7004621
crossref_citationtrail_10_1109_JAS_2014_7004621
PublicationCentury 2000
PublicationDate 2014-Jan.
2014-1-00
PublicationDateYYYYMMDD 2014-01-01
PublicationDate_xml – month: 01
  year: 2014
  text: 2014-Jan.
PublicationDecade 2010
PublicationTitle IEEE/CAA journal of automatica sinica
PublicationTitleAbbrev JAS
PublicationYear 2014
Publisher Chinese Association of Automation (CAA)
Publisher_xml – name: Chinese Association of Automation (CAA)
SSID ssj0001257694
Score 1.9853224
Snippet In this paper, we propose an approximate gradient algorithm for the multi-agent convex optimization problem with constraints. The agents cooperatively compute...
SourceID crossref
ieee
SourceType Enrichment Source
Index Database
Publisher
StartPage 61
SubjectTerms Algorithm design and analysis
approximate gradient
Approximation algorithms
Constraints
Convex functions
distributed optimization
Linear programming
Multi-agent systems
Optimization
Title An approximate gradient algorithm for constrained distributed convex optimization
URI https://ieeexplore.ieee.org/document/7004621
Volume 1
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 2329-9274
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001257694
  issn: 2329-9266
  databaseCode: RIE
  dateStart: 20140101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61eNCDryrWFzl4Edw2-0xyLKKISFFU6G3JTpJaaHdl3Up_vkl2WyqI4C2EZAmzy843k5nvQ-hScQmBJrEXhKEJUCSAJxLQniQCEu0rngnXKPxIh0M2GvGnFrpe9cIopVzxmerZobvLlwXMbaqsT10rpYl1NihN6l6ttXyKQc5O99BgBO5x43iWt5KE9x8GL7aMK-o1j_jhhdZkVZxXudv933n20E6DHvGgft37qKXyA7S9xinYQc-DHDui8MXEgFGFx6Ur6qqwmI6LclK9z7DBqRgsLrTyEEpiaclzre6VGbsq9AUuzJ9k1rRoHqK3u9vXm3uv0U3wwKes8jKDmmVAQdA44aCIZAwYUSQLtIiBhlEURjTxleJagqaCSRbLOKSZzwhNqAiPUDsvcnWMMBNMm4AmIxmNIyCMB0wKQROIaShA6i7qL-2YQkMqbg8_TV1wQXhqLJ9ay6eNsbroarXjoybU-GNtxxp9ta6ZPvl9-hRt2c11fuQMtatyrs7RJnxVk8_ywn0t3xHnvsI
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5FBfXgq4r1mYMXwW2zzyTHIpaqtShW6G3JTrK10IesW-nPN8luSwURvIWQDWF22flmMvN9CF0pLsFLSeh4vq8DFAngiAhSRxIBUeoqngjbKNyh3S7r9_lzBd0se2GUUrb4TNXN0N7lyynMTKqsQW0rpY511sMg8EjRrbWSUdHY2SofapTAHa5dz-JekvDGQ_PVFHIF9XKTH35oRVjF-pXW7v9OtId2SvyIm8UL30cVNTlA2yusglX00pxgSxU-H2o4qvAgs2VdORajwTQb5u9jrJEqBoMMjUCEklga-lyjfKXHtg59jqf6XzIumzQP0VvrrnfbdkrlBAdcynIn0bhZehQEDSMOikjGgBFFEi8VIVA_CPyARq5SPJWQUsEkC2Xo08RlhEZU-EdobTKdqGOEmWCpDmkSktAwAMK4x6QQNIKQ-gJkWkONhR1jKGnFzeFHsQ0vCI-15WNj-bg0Vg1dL5_4KCg1_lhbNUZfriunT36fvkSb7d5TJ-7cdx9P0ZbZqMiWnKG1PJupc7QBX_nwM7uwX843KsnCCQ
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=An+approximate+gradient+algorithm+for+constrained+distributed+convex+optimization&rft.jtitle=IEEE%2FCAA+journal+of+automatica+sinica&rft.au=Zhang%2C+Yanqiong&rft.au=Lou%2C+Youcheng&rft.au=Hong%2C+Yiguang&rft.date=2014-01-01&rft.issn=2329-9266&rft.eissn=2329-9274&rft.volume=1&rft.issue=1&rft.spage=61&rft.epage=67&rft_id=info:doi/10.1109%2FJAS.2014.7004621&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_JAS_2014_7004621
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2329-9266&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2329-9266&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2329-9266&client=summon