Distributed multi-agent optimization subject to nonidentical constraints and communication delays
In this paper, we study a distributed optimization problem using a subgradient projection algorithm for multi-agent systems subject to nonidentical constraints and communication delays under local communication. Here the agents capable of communicating with their local neighbors are constrained to r...
Saved in:
| Published in: | Automatica (Oxford) Vol. 65; pp. 120 - 131 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.03.2016
|
| Subjects: | |
| ISSN: | 0005-1098, 1873-2836 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In this paper, we study a distributed optimization problem using a subgradient projection algorithm for multi-agent systems subject to nonidentical constraints and communication delays under local communication. Here the agents capable of communicating with their local neighbors are constrained to remain in possibly different closed convex sets and optimize a global objective function composed of a sum of local objective functions, each of which is known to only one agent. First, we consider the case of fixed graphs and show that distributed optimization might not be achieved on general strongly connected directed graphs. Instead, the agents optimize a weighted sum of the local objective functions. Then we consider the case of switching graphs and show that distributed optimization can be achieved when the adjacency matrices are doubly stochastic and the union of the directed graphs is strongly connected among each time interval of a certain bounded length. Furthermore, we consider the case of communication delays, where the delays are mutually independent. It is shown that the distributed optimization problem can be solved by introducing additional delays to the subgradient projection algorithm and the communication delays can be arbitrarily bounded. Finally, numerical examples are included to show the obtained theoretical results. |
|---|---|
| AbstractList | In this paper, we study a distributed optimization problem using a subgradient projection algorithm for multi-agent systems subject to nonidentical constraints and communication delays under local communication. Here the agents capable of communicating with their local neighbors are constrained to remain in possibly different closed convex sets and optimize a global objective function composed of a sum of local objective functions, each of which is known to only one agent. First, we consider the case of fixed graphs and show that distributed optimization might not be achieved on general strongly connected directed graphs. Instead, the agents optimize a weighted sum of the local objective functions. Then we consider the case of switching graphs and show that distributed optimization can be achieved when the adjacency matrices are doubly stochastic and the union of the directed graphs is strongly connected among each time interval of a certain bounded length. Furthermore, we consider the case of communication delays, where the delays are mutually independent. It is shown that the distributed optimization problem can be solved by introducing additional delays to the subgradient projection algorithm and the communication delays can be arbitrarily bounded. Finally, numerical examples are included to show the obtained theoretical results. |
| Author | Lin, Peng Song, Yongduan Ren, Wei |
| Author_xml | – sequence: 1 givenname: Peng surname: Lin fullname: Lin, Peng email: lin_peng0103@sohu.com organization: School of Electronic and Information Engineering, Xi’an Jiaotong University, China – sequence: 2 givenname: Wei surname: Ren fullname: Ren, Wei email: ren@ee.ucr.edu organization: Department of Electrical and Computer Engineering, University of California, Riverside, USA – sequence: 3 givenname: Yongduan surname: Song fullname: Song, Yongduan email: ydsong@cqu.edu.cn organization: Key Laboratory of Dependable Service Computing, Cyber Physical Society of Ministry of Education, Chongqing University, China |
| BookMark | eNqNkE1LxDAURYOM4Iz6H7p005rX9CPdCDp-woAbXYc0eZUMbTI2qTD-ejMzguBGV-GRe89LzoLMrLNISAI0AwrV5TqTU3CDDEbJLKdQZgAZheKIzIHXLM05q2ZkTiktU6ANPyEL79dxLIDncyJvjQ-jaaeAOhmmPphUvqENidsEM5jPyHU28VO7RhWS4JK43ugYiOv6RDkb29LY4BNpdZyHYbLxat_S2MutPyPHnew9nn-fp-T1_u5l-Ziunh-elterVBVQh1QzzTvJNS8QSgZlU7E27zRjWnctKCWbuqEcG1VWOUoJTc46rZE3ZS1prik7JRcH7mZ07xP6IAbjFfa9tOgmL6BuWF7UZcVj9OoQVaPzfsROKBP2b959phdAxc6tWIsft2LnVgCI6DYC-C_AZjSDHLf_qd4cqhhdfBgchVcGrUJtxqhYaGf-hnwBa_agXQ |
| CitedBy_id | crossref_primary_10_1109_TAC_2022_3169179 crossref_primary_10_1109_TCNS_2020_3029996 crossref_primary_10_1016_j_sysconle_2021_104879 crossref_primary_10_1177_1550147717726296 crossref_primary_10_1016_j_automatica_2020_109060 crossref_primary_10_1109_TSIPN_2021_3122302 crossref_primary_10_1109_TCNS_2021_3070663 crossref_primary_10_1016_j_automatica_2023_110858 crossref_primary_10_1109_TAC_2023_3284599 crossref_primary_10_1109_TSG_2022_3201814 crossref_primary_10_1016_j_automatica_2018_07_020 crossref_primary_10_1016_j_automatica_2019_108755 crossref_primary_10_1016_j_automatica_2017_12_053 crossref_primary_10_1109_TSIPN_2022_3188450 crossref_primary_10_1049_iet_cta_2017_0328 crossref_primary_10_1016_j_automatica_2018_05_020 crossref_primary_10_1016_j_isatra_2024_03_024 crossref_primary_10_1109_TAC_2025_3535578 crossref_primary_10_1109_TCYB_2018_2852333 crossref_primary_10_1007_s40747_022_00770_1 crossref_primary_10_1016_j_sysconle_2018_04_004 crossref_primary_10_1016_j_jfranklin_2025_108050 crossref_primary_10_1109_TAC_2021_3056233 crossref_primary_10_1109_TNNLS_2019_2951790 crossref_primary_10_1002_rnc_5543 crossref_primary_10_1109_ACCESS_2019_2905874 crossref_primary_10_1016_j_ifacol_2020_12_1136 crossref_primary_10_1109_ACCESS_2019_2909315 crossref_primary_10_1109_TAC_2017_2771140 crossref_primary_10_1002_rnc_4330 crossref_primary_10_1109_TCYB_2020_2988490 crossref_primary_10_1016_j_jfranklin_2021_07_015 crossref_primary_10_1109_ACCESS_2020_2964324 crossref_primary_10_1002_rnc_7308 crossref_primary_10_1049_iet_cta_2018_6026 crossref_primary_10_1155_2017_5679073 crossref_primary_10_1002_asjc_2630 crossref_primary_10_1016_j_automatica_2023_110869 crossref_primary_10_1016_j_ifacol_2017_08_434 crossref_primary_10_1007_s11432_016_0094_7 crossref_primary_10_1109_TAC_2020_2977940 crossref_primary_10_1109_TAC_2023_3261465 crossref_primary_10_1109_TNSE_2022_3155481 crossref_primary_10_1109_TSMC_2023_3331260 crossref_primary_10_1016_j_neucom_2024_128954 crossref_primary_10_1016_j_automatica_2018_05_032 crossref_primary_10_1002_rnc_4040 crossref_primary_10_1016_j_sysconle_2017_02_002 crossref_primary_10_1016_j_arcontrol_2019_05_006 crossref_primary_10_1109_TAC_2024_3453382 crossref_primary_10_12677_aam_2024_137306 crossref_primary_10_1109_COMST_2020_3023963 crossref_primary_10_1002_rnc_4289 crossref_primary_10_1016_j_jfranklin_2019_12_035 crossref_primary_10_1080_00207721_2020_1820622 crossref_primary_10_1109_TCYB_2018_2794506 crossref_primary_10_1016_j_neucom_2021_09_042 crossref_primary_10_1088_1674_1056_abfb5b crossref_primary_10_1007_s00521_023_09205_5 crossref_primary_10_1109_TAC_2021_3131678 crossref_primary_10_1177_00202940211029332 crossref_primary_10_1109_TCYB_2018_2856510 crossref_primary_10_1109_TSMC_2019_2961421 crossref_primary_10_1109_TII_2023_3334307 crossref_primary_10_1007_s11424_020_9152_6 crossref_primary_10_1016_j_automatica_2016_11_029 crossref_primary_10_1007_s11424_023_1250_9 crossref_primary_10_1016_j_automatica_2025_112575 crossref_primary_10_1109_TAC_2024_3445575 crossref_primary_10_3390_app11199170 crossref_primary_10_1109_TAC_2021_3054072 crossref_primary_10_1016_j_physa_2019_03_063 crossref_primary_10_1109_TAC_2019_2930234 crossref_primary_10_1002_rnc_4076 crossref_primary_10_1016_j_sysconle_2017_02_010 crossref_primary_10_1109_TSMC_2024_3405453 crossref_primary_10_1109_ACCESS_2019_2925414 crossref_primary_10_1016_j_jfranklin_2022_09_047 crossref_primary_10_1049_iet_cta_2019_0708 crossref_primary_10_1016_j_apenergy_2021_117516 crossref_primary_10_1109_TAC_2017_2763782 crossref_primary_10_1109_ACCESS_2024_3361808 crossref_primary_10_1080_00207721_2020_1819467 crossref_primary_10_1109_TAC_2016_2637005 crossref_primary_10_1109_TCNS_2024_3354840 crossref_primary_10_1016_j_automatica_2021_109738 crossref_primary_10_1109_TSMC_2024_3458972 crossref_primary_10_1016_j_neucom_2019_01_044 crossref_primary_10_1109_TAC_2025_3528410 crossref_primary_10_1016_j_automatica_2019_02_003 crossref_primary_10_1016_j_ifacol_2022_11_345 crossref_primary_10_1109_TAC_2023_3332009 crossref_primary_10_1002_rnc_7179 crossref_primary_10_1109_TSMC_2023_3298700 crossref_primary_10_1155_2015_467060 crossref_primary_10_1177_1550147718778501 crossref_primary_10_1016_j_sysconle_2021_104955 crossref_primary_10_1109_TAC_2018_2852602 crossref_primary_10_1002_oca_2688 crossref_primary_10_1016_j_isatra_2017_06_013 crossref_primary_10_1109_TAI_2023_3326113 crossref_primary_10_1080_00207721_2017_1406551 crossref_primary_10_1109_TSIPN_2023_3338467 crossref_primary_10_1016_j_apenergy_2021_117383 crossref_primary_10_1007_s12555_016_0453_4 crossref_primary_10_1109_TAC_2020_3033490 crossref_primary_10_1016_j_jfranklin_2019_03_021 crossref_primary_10_1080_10556788_2021_2023524 crossref_primary_10_1007_s11042_018_6680_3 crossref_primary_10_1016_j_neunet_2021_05_020 crossref_primary_10_1049_iet_cta_2017_0893 crossref_primary_10_1109_TAC_2018_2874748 crossref_primary_10_1080_00207179_2023_2206501 crossref_primary_10_1051_e3sconf_202346101022 crossref_primary_10_1007_s11768_024_00223_9 crossref_primary_10_1109_TCNS_2018_2797805 crossref_primary_10_1007_s12555_023_0140_1 crossref_primary_10_1109_TCYB_2018_2813431 crossref_primary_10_1109_TAC_2019_2901829 crossref_primary_10_1109_TAC_2023_3264784 crossref_primary_10_1109_LCSYS_2025_3581718 crossref_primary_10_1109_TAC_2016_2604324 crossref_primary_10_1007_s12555_022_1055_y crossref_primary_10_1016_j_jfranklin_2021_05_024 crossref_primary_10_1007_s11424_020_9021_3 crossref_primary_10_1016_j_arcontrol_2019_04_008 crossref_primary_10_1109_TCYB_2017_2726102 crossref_primary_10_1016_j_jfranklin_2020_05_043 crossref_primary_10_1002_asjc_3802 crossref_primary_10_1109_ACCESS_2023_3305529 crossref_primary_10_1155_2015_957028 crossref_primary_10_1109_TCYB_2018_2869706 crossref_primary_10_1016_j_automatica_2023_111364 crossref_primary_10_1109_TNNLS_2023_3245812 crossref_primary_10_1002_asjc_2025 crossref_primary_10_1016_j_automatica_2022_110312 crossref_primary_10_1109_ACCESS_2020_3007731 crossref_primary_10_1109_ACCESS_2021_3082537 crossref_primary_10_1177_1550147717726313 crossref_primary_10_1016_j_automatica_2024_111847 crossref_primary_10_1109_ACCESS_2019_2939953 crossref_primary_10_1016_j_neucom_2018_08_002 crossref_primary_10_1109_TCYB_2019_2903852 crossref_primary_10_1109_TAC_2022_3230767 crossref_primary_10_1109_TAC_2019_2910946 crossref_primary_10_1109_TNSE_2023_3336921 crossref_primary_10_1080_00207721_2022_2063967 crossref_primary_10_1002_oca_3145 crossref_primary_10_1016_j_ins_2021_02_049 crossref_primary_10_1016_j_jfranklin_2021_04_044 crossref_primary_10_1177_1550147717722513 crossref_primary_10_1109_TSMC_2017_2757265 crossref_primary_10_1109_TFUZZ_2024_3441008 crossref_primary_10_1109_TCNS_2022_3161194 crossref_primary_10_1155_2016_1604824 crossref_primary_10_1109_TII_2020_2996198 crossref_primary_10_1109_TCNS_2021_3092832 crossref_primary_10_1109_ACCESS_2019_2925053 crossref_primary_10_1007_s12555_021_0157_2 crossref_primary_10_1016_j_amc_2022_127117 crossref_primary_10_1109_TCYB_2018_2890140 crossref_primary_10_1109_TAC_2018_2872195 crossref_primary_10_3390_app12052300 crossref_primary_10_1109_LCSYS_2018_2843679 crossref_primary_10_1155_2016_4860785 |
| Cites_doi | 10.1109/CDC.2006.376808 10.1109/JSTSP.2011.2120593 10.1007/s10107-011-0467-x 10.1109/TAC.2011.2160020 10.1109/TAC.2010.2041686 10.1109/TAC.2010.2079650 10.1109/CDC.2011.6161134 10.1109/TAC.2011.2161027 10.1109/CDC.2012.6425866 10.1109/CDC.2007.4434888 10.1007/s10898-008-9370-2 10.1080/00207170600825097 10.1137/080726380 10.1109/TAC.2008.2009515 10.1007/s10957-010-9737-7 10.1109/JSTSP.2011.2118740 10.1109/TSMCB.2011.2160394 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier Ltd |
| Copyright_xml | – notice: 2015 Elsevier Ltd |
| DBID | AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.automatica.2015.11.014 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Electronics & Communications 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 Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1873-2836 |
| EndPage | 131 |
| ExternalDocumentID | 10_1016_j_automatica_2015_11_014 S0005109815004781 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1~. 1~5 23N 3R3 4.4 457 4G. 5GY 5VS 6TJ 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABDEX ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACBEA ACDAQ ACGFO ACGFS ACNNM ACRLP ADBBV ADEZE ADIYS ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHPGS AI. AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ RXW SBC SDF SDG SDP SES SET SEW SPC SPCBC SSB SSD SST SSZ T5K T9H TAE TN5 VH1 WH7 WUQ X6Y XFK XPP ZMT ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABUFD ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 7SP 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c417t-d3d8fa8d84e15315963b2fd33ddfb1cca97908e9c562eaa1923fdde8957a02d03 |
| ISICitedReferencesCount | 203 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000375509400013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0005-1098 |
| IngestDate | Thu Oct 02 09:21:58 EDT 2025 Sat Nov 29 01:49:39 EST 2025 Tue Nov 18 22:01:44 EST 2025 Fri Feb 23 02:23:45 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Distributed optimization Switching topologies Cooperative control Communication delays Multi-agent systems |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c417t-d3d8fa8d84e15315963b2fd33ddfb1cca97908e9c562eaa1923fdde8957a02d03 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1793247568 |
| PQPubID | 23500 |
| PageCount | 12 |
| ParticipantIDs | proquest_miscellaneous_1793247568 crossref_citationtrail_10_1016_j_automatica_2015_11_014 crossref_primary_10_1016_j_automatica_2015_11_014 elsevier_sciencedirect_doi_10_1016_j_automatica_2015_11_014 |
| PublicationCentury | 2000 |
| PublicationDate | March 2016 2016-03-00 20160301 |
| PublicationDateYYYYMMDD | 2016-03-01 |
| PublicationDate_xml | – month: 03 year: 2016 text: March 2016 |
| PublicationDecade | 2010 |
| PublicationTitle | Automatica (Oxford) |
| PublicationYear | 2016 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Nedić, Ozdaglar (br000060) 2009; 54 Johansson, B., Keviczky, T., Johansson, M., & Johansson, K. H. (2007). A simple peer-to-peer algorithm for distributed optimization in sensor networks. In Matei, Baras (br000050) 2011; 5 Wei, E., Ozdaglar, A., & Jadbabaie, A. (2011). A distributed Newton method for network utility maximization. In (pp. 6813–6818). Horn, Johnson (br000025) 1987 Xiao, Wang (br000095) 2006; 79 Bertsekas, Nedić, Ozdaglar (br000005) 2003 Nedić (br000055) 2011; 56 Zhu, M., & Martínez, Sonia (2010). An approximate dual subgradient algorithm for distributed non-convex constrained optimization. In Yuan, Xu, Zhao (br000100) 2011; 41 Lu, Tang, Regier, Bow (br000045) 2011; 56 Nedić, Ozdaglar, Parrilo (br000070) 2010; 55 (pp. 6612–6617). Godsil, Royle (br000020) 2001 (pp. 4705–4710). Srivastava, Nedić (br000085) 2011; 5 Cao, M., Morse, A. S., & Anderson, B. D. O. (2006). Reaching an agreement using delayed information. In Lin, P., & Ren, W. (2012). Distributed subgradient projection algorithm for multi-agent optimization with nonidentical constraints and switching topologies. In Nedić, Ozdaglar (br000065) 2010; 47 (pp. 7487–7492). Ram, Nedić, Veeravalli (br000080) 2010; 147 Lobel, Ozdaglar, Feijer (br000040) 2011; 129 (pp. 3375–3380). Duchi, Agarwal, Wainwright (br000015) 2012; 57 Ram, Nedić, Veeravalli (br000075) 2009; 20 Srivastava (10.1016/j.automatica.2015.11.014_br000085) 2011; 5 10.1016/j.automatica.2015.11.014_br000090 Nedić (10.1016/j.automatica.2015.11.014_br000060) 2009; 54 Nedić (10.1016/j.automatica.2015.11.014_br000070) 2010; 55 Matei (10.1016/j.automatica.2015.11.014_br000050) 2011; 5 Yuan (10.1016/j.automatica.2015.11.014_br000100) 2011; 41 10.1016/j.automatica.2015.11.014_br000035 Godsil (10.1016/j.automatica.2015.11.014_br000020) 2001 Ram (10.1016/j.automatica.2015.11.014_br000075) 2009; 20 Bertsekas (10.1016/j.automatica.2015.11.014_br000005) 2003 10.1016/j.automatica.2015.11.014_br000105 Lu (10.1016/j.automatica.2015.11.014_br000045) 2011; 56 Lobel (10.1016/j.automatica.2015.11.014_br000040) 2011; 129 10.1016/j.automatica.2015.11.014_br000030 Nedić (10.1016/j.automatica.2015.11.014_br000065) 2010; 47 10.1016/j.automatica.2015.11.014_br000010 Ram (10.1016/j.automatica.2015.11.014_br000080) 2010; 147 Xiao (10.1016/j.automatica.2015.11.014_br000095) 2006; 79 Horn (10.1016/j.automatica.2015.11.014_br000025) 1987 Nedić (10.1016/j.automatica.2015.11.014_br000055) 2011; 56 Duchi (10.1016/j.automatica.2015.11.014_br000015) 2012; 57 |
| References_xml | – reference: Johansson, B., Keviczky, T., Johansson, M., & Johansson, K. H. (2007). A simple peer-to-peer algorithm for distributed optimization in sensor networks. In – volume: 147 start-page: 516 year: 2010 end-page: 545 ident: br000080 article-title: Distributed stochastic subgradient projection algorithms for convex optimization publication-title: Journal of Optimization Theory and Applications – volume: 129 start-page: 255 year: 2011 end-page: 284 ident: br000040 article-title: Distributed multi-agent optimization with state-dependent communication publication-title: Mathematical Programming – volume: 79 start-page: 1277 year: 2006 end-page: 1284 ident: br000095 article-title: State consensus for multi-agent systems with switching topologies and time-varying delays publication-title: International Journal of Control – reference: Cao, M., Morse, A. S., & Anderson, B. D. O. (2006). Reaching an agreement using delayed information. In – reference: (pp. 6612–6617). – volume: 5 start-page: 754 year: 2011 end-page: 771 ident: br000050 article-title: Performance evaluation of the consensus-based distributed subgradient method under random communication topologies publication-title: IEEE Journal of Selected Topics in Signal Processing – reference: Wei, E., Ozdaglar, A., & Jadbabaie, A. (2011). A distributed Newton method for network utility maximization. In – reference: Zhu, M., & Martínez, Sonia (2010). An approximate dual subgradient algorithm for distributed non-convex constrained optimization. In – reference: (pp. 7487–7492). – year: 2001 ident: br000020 article-title: Algebraic graph theory – year: 1987 ident: br000025 article-title: Matrix analysis – reference: (pp. 4705–4710). – volume: 57 start-page: 592 year: 2012 end-page: 606 ident: br000015 article-title: Dual averaging for distributed optimization: Convergence analysis and network scaling publication-title: IEEE Transactions on Automatic Control – year: 2003 ident: br000005 article-title: Convex analysis and optimization – reference: Lin, P., & Ren, W. (2012). Distributed subgradient projection algorithm for multi-agent optimization with nonidentical constraints and switching topologies. In – volume: 56 start-page: 2917 year: 2011 end-page: 2923 ident: br000045 article-title: Gossip algorithms for convex consensus optimization over networks publication-title: IEEE Transactions on Automatic Control – volume: 54 start-page: 48 year: 2009 end-page: 61 ident: br000060 article-title: Distributed subgradient methods for multi-agent optimization publication-title: IEEE Transactions on Automatic Control – reference: (pp. 3375–3380). – volume: 20 start-page: 691 year: 2009 end-page: 717 ident: br000075 article-title: Incremental stochastic subgradient algorithms for convex optimization publication-title: SIAM Journal on Optimization – volume: 5 start-page: 772 year: 2011 end-page: 790 ident: br000085 article-title: Distributed asynchronous constrained stochastic optimization publication-title: IEEE Journal of Selected Topics in Signal Processing – volume: 55 start-page: 922 year: 2010 end-page: 938 ident: br000070 article-title: Constrained consensus and optimization in multi-agent networks publication-title: IEEE Transactions on Automatic Control – volume: 47 start-page: 437 year: 2010 end-page: 456 ident: br000065 article-title: Convergence rate for consensus with delays publication-title: Journal of Global Optimization – volume: 41 start-page: 1715 year: 2011 end-page: 1724 ident: br000100 article-title: Distributed primal–dual subgradient method for multiagent optimization via consensus algorithms publication-title: IEEE Transactions on Systems, Man and Cybernetics Part-B: Cybernetics – volume: 56 start-page: 1337 year: 2011 end-page: 1351 ident: br000055 article-title: Asynchronous broadcast-based convex optimization over a network publication-title: IEEE Transactions on Automatic Control – reference: (pp. 6813–6818). – ident: 10.1016/j.automatica.2015.11.014_br000010 doi: 10.1109/CDC.2006.376808 – volume: 5 start-page: 754 issue: 4 year: 2011 ident: 10.1016/j.automatica.2015.11.014_br000050 article-title: Performance evaluation of the consensus-based distributed subgradient method under random communication topologies publication-title: IEEE Journal of Selected Topics in Signal Processing doi: 10.1109/JSTSP.2011.2120593 – volume: 129 start-page: 255 issue: 2 year: 2011 ident: 10.1016/j.automatica.2015.11.014_br000040 article-title: Distributed multi-agent optimization with state-dependent communication publication-title: Mathematical Programming doi: 10.1007/s10107-011-0467-x – volume: 56 start-page: 2917 issue: 12 year: 2011 ident: 10.1016/j.automatica.2015.11.014_br000045 article-title: Gossip algorithms for convex consensus optimization over networks publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2011.2160020 – volume: 55 start-page: 922 issue: 4 year: 2010 ident: 10.1016/j.automatica.2015.11.014_br000070 article-title: Constrained consensus and optimization in multi-agent networks publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2010.2041686 – volume: 56 start-page: 1337 issue: 6 year: 2011 ident: 10.1016/j.automatica.2015.11.014_br000055 article-title: Asynchronous broadcast-based convex optimization over a network publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2010.2079650 – ident: 10.1016/j.automatica.2015.11.014_br000090 doi: 10.1109/CDC.2011.6161134 – volume: 57 start-page: 592 issue: 3 year: 2012 ident: 10.1016/j.automatica.2015.11.014_br000015 article-title: Dual averaging for distributed optimization: Convergence analysis and network scaling publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2011.2161027 – ident: 10.1016/j.automatica.2015.11.014_br000035 doi: 10.1109/CDC.2012.6425866 – year: 1987 ident: 10.1016/j.automatica.2015.11.014_br000025 – ident: 10.1016/j.automatica.2015.11.014_br000030 doi: 10.1109/CDC.2007.4434888 – volume: 47 start-page: 437 issue: 3 year: 2010 ident: 10.1016/j.automatica.2015.11.014_br000065 article-title: Convergence rate for consensus with delays publication-title: Journal of Global Optimization doi: 10.1007/s10898-008-9370-2 – ident: 10.1016/j.automatica.2015.11.014_br000105 – year: 2003 ident: 10.1016/j.automatica.2015.11.014_br000005 – volume: 79 start-page: 1277 issue: 10 year: 2006 ident: 10.1016/j.automatica.2015.11.014_br000095 article-title: State consensus for multi-agent systems with switching topologies and time-varying delays publication-title: International Journal of Control doi: 10.1080/00207170600825097 – year: 2001 ident: 10.1016/j.automatica.2015.11.014_br000020 – volume: 20 start-page: 691 issue: 2 year: 2009 ident: 10.1016/j.automatica.2015.11.014_br000075 article-title: Incremental stochastic subgradient algorithms for convex optimization publication-title: SIAM Journal on Optimization doi: 10.1137/080726380 – volume: 54 start-page: 48 issue: 1 year: 2009 ident: 10.1016/j.automatica.2015.11.014_br000060 article-title: Distributed subgradient methods for multi-agent optimization publication-title: IEEE Transactions on Automatic Control doi: 10.1109/TAC.2008.2009515 – volume: 147 start-page: 516 issue: 3 year: 2010 ident: 10.1016/j.automatica.2015.11.014_br000080 article-title: Distributed stochastic subgradient projection algorithms for convex optimization publication-title: Journal of Optimization Theory and Applications doi: 10.1007/s10957-010-9737-7 – volume: 5 start-page: 772 issue: 4 year: 2011 ident: 10.1016/j.automatica.2015.11.014_br000085 article-title: Distributed asynchronous constrained stochastic optimization publication-title: IEEE Journal of Selected Topics in Signal Processing doi: 10.1109/JSTSP.2011.2118740 – volume: 41 start-page: 1715 issue: 6 year: 2011 ident: 10.1016/j.automatica.2015.11.014_br000100 article-title: Distributed primal–dual subgradient method for multiagent optimization via consensus algorithms publication-title: IEEE Transactions on Systems, Man and Cybernetics Part-B: Cybernetics doi: 10.1109/TSMCB.2011.2160394 |
| SSID | ssj0004182 |
| Score | 2.6026225 |
| Snippet | In this paper, we study a distributed optimization problem using a subgradient projection algorithm for multi-agent systems subject to nonidentical constraints... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 120 |
| SubjectTerms | Algorithms Communication delays Cooperative control Delay Distributed optimization Graph theory Graphs Mathematical analysis Mathematical models Multi-agent systems Optimization Projection Switching topologies |
| Title | Distributed multi-agent optimization subject to nonidentical constraints and communication delays |
| URI | https://dx.doi.org/10.1016/j.automatica.2015.11.014 https://www.proquest.com/docview/1793247568 |
| Volume | 65 |
| WOSCitedRecordID | wos000375509400013&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-2836 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004182 issn: 0005-1098 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fi9QwEA6y54M-iD_xPJUIvh2VpmmbBJ8WPVE5jns4cX0qaZrKHufucW1l7793pknb3Km4Cr60pZCQdr7MTCYzXwh5qXKbGJ2yqOR5HqUys5FMaxHB3OJGS8ZL07PrH4qjI7lYqGMfVWr64wTEaiU3G3X-X0UN70DYWDr7F-IeO4UX8AxChyuIHa5bCf4tUuHiKVbgSvbpgpH-2m_4g3L45qsu95uuxAAMep6w_l_21bqOKgQZZfUSk2N8xdtUP7KPjJKXTejPzrt23ZO-6p63dONS5cfgwqFjKDi23j7izo7Tc5_tcgzu-KzgL3CvOo9WH4hg-ZSJNSpXJDV1h0oPyjXPAu3IkjgwtMyp_590uAsnnGIGj_8CzMDLXiHZqis4vUqbfc2cjUmGQ_7aaTH1VGBPsOopYjz8fCcRmZIzsjP_cLD4OJXTMulI5v33-AQwlxb461H9zqu5Zt97p-XkLrnjVxt07lByj9ywq_vkdsBB-YDoAC80wAsN8UI9Xmi7piFeaIAXCnihV_BCHV4ekk_vDk7evI_8uRuRSZloo4pXstaykqkFewj-bs7LpK44r6q6ZDDllVCxtMqA72y1xjVCDVZSqkzoOKli_ojMYCz2MaGqNFJzXUJ_IrWmlLEWzCitdG2ZsWKXiOG_FcaT0uOoz4o_SW-XsLHluSNm2aLN60E0hXcwneNYAPa2aP1ikGYBOhg31vTKrrumQCOXpCLL5ZN_GNUeuTVNp6dk1l509hm5ab63y-biuQfnD0sstLs |
| linkProvider | Elsevier |
| 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+multi-agent+optimization+subject+to+nonidentical+constraints+and+communication+delays&rft.jtitle=Automatica+%28Oxford%29&rft.au=Lin%2C+Peng&rft.au=Ren%2C+Wei&rft.au=Song%2C+Yongduan&rft.date=2016-03-01&rft.issn=0005-1098&rft.volume=65&rft.spage=120&rft.epage=131&rft_id=info:doi/10.1016%2Fj.automatica.2015.11.014&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_automatica_2015_11_014 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0005-1098&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0005-1098&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0005-1098&client=summon |