Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints

The distributed convex optimization problem is studied in this paper for any fixed and connected network with general constraints. To solve such an optimization problem, a new type of continuous-time distributed subgradient optimization algorithm is proposed based on the Karuch-Kuhn-Tucker condition...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control Vol. 64; no. 4; pp. 1694 - 1701
Main Authors: Zhu, Yanan, Yu, Wenwu, Wen, Guanghui, Chen, Guanrong, Ren, Wei
Format: Journal Article
Language:English
Published: New York IEEE 01.04.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:0018-9286, 1558-2523
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The distributed convex optimization problem is studied in this paper for any fixed and connected network with general constraints. To solve such an optimization problem, a new type of continuous-time distributed subgradient optimization algorithm is proposed based on the Karuch-Kuhn-Tucker condition. By using tools from nonsmooth analysis and set-valued function theory, it is proved that the distributed convex optimization problem is solved on a network of agents equipped with the designed algorithm. For the case that the objective function is convex but not strictly convex, it is proved that the states of the agents associated with optimal variables could converge to an optimal solution of the optimization problem. For the case that the objective function is strictly convex, it is further shown that the states of agents associated with optimal variables could converge to the unique optimal solution. Finally, some simulations are performed to illustrate the theoretical analysis.
AbstractList The distributed convex optimization problem is studied in this paper for any fixed and connected network with general constraints. To solve such an optimization problem, a new type of continuous-time distributed subgradient optimization algorithm is proposed based on the Karuch–Kuhn–Tucker condition. By using tools from nonsmooth analysis and set-valued function theory, it is proved that the distributed convex optimization problem is solved on a network of agents equipped with the designed algorithm. For the case that the objective function is convex but not strictly convex, it is proved that the states of the agents associated with optimal variables could converge to an optimal solution of the optimization problem. For the case that the objective function is strictly convex, it is further shown that the states of agents associated with optimal variables could converge to the unique optimal solution. Finally, some simulations are performed to illustrate the theoretical analysis.
Author Zhu, Yanan
Ren, Wei
Yu, Wenwu
Wen, Guanghui
Chen, Guanrong
Author_xml – sequence: 1
  givenname: Yanan
  orcidid: 0000-0001-7980-6282
  surname: Zhu
  fullname: Zhu, Yanan
  email: zhuxiaoyazhuyanan@163.com
  organization: School of Mathematics, Southeast University, Nanjing, China
– sequence: 2
  givenname: Wenwu
  orcidid: 0000-0003-3755-179X
  surname: Yu
  fullname: Yu, Wenwu
  email: wwyu@seu.edu.cn
  organization: School of Mathematics, Southeast University, Nanjing, China
– sequence: 3
  givenname: Guanghui
  orcidid: 0000-0003-0070-8597
  surname: Wen
  fullname: Wen, Guanghui
  email: wenguanghui@gmail.com
  organization: School of Mathematics, Southeast University, Nanjing, China
– sequence: 4
  givenname: Guanrong
  orcidid: 0000-0003-1381-7418
  surname: Chen
  fullname: Chen, Guanrong
  email: eegchen@cityu.edu.hk
  organization: Department of Electronic Engineering, City University of Hong Kong, Hong Kong
– sequence: 5
  givenname: Wei
  orcidid: 0000-0002-2818-9752
  surname: Ren
  fullname: Ren, Wei
  email: ren@ee.ucr.edu
  organization: Department of Electrical and Computer Engineering, University of California, Riverside, CA, USA
BookMark eNp9kD1PwzAQhi1UJFpgR2KJxJxiXxLXHqsCBalSB4oYIyc5g1FrF9tBwK_HpYiBgenudO9zH--IDKyzSMgZo2PGqLxcTWdjoEyMQVTAKRyQIasqkUMFxYAMaWrlEgQ_IqMQXlLJy5INSTNzNhrbuz7kK7PB7MqE6E3TR-yy-7558qozaGM2XT85b-LzJtPOZ4l6w_dsuY1mYz5VNM5mj6mbzdGiV-udIM1RxsZwQg61Wgc8_YnH5OHmejW7zRfL-d1sushbkCzmumwnumPIsWu4LtikLajUKqWV6iaNlhI0UME6gAmqkvGOQyFUJSUvscKuOCYX-7lb7157DLF-cb23aWUNQKkAIUpIKr5Xtd6F4FHXrYnfD-zOXdeM1js_6-RnvfOz_vEzgfQPuPVmo_zHf8j5HjGI-CsXJWWSVcUXAQiD1A
CODEN IETAA9
CitedBy_id crossref_primary_10_1016_j_jfranklin_2023_12_030
crossref_primary_10_1109_TCNS_2020_3029996
crossref_primary_10_1109_TSIPN_2024_3430492
crossref_primary_10_1109_TSMC_2021_3137814
crossref_primary_10_3390_fractalfract5030062
crossref_primary_10_1109_TCST_2024_3405711
crossref_primary_10_1109_TNSE_2021_3133541
crossref_primary_10_1016_j_cnsns_2024_107999
crossref_primary_10_1016_j_sysconle_2021_105002
crossref_primary_10_1002_oca_2688
crossref_primary_10_1109_TII_2022_3146165
crossref_primary_10_1007_s11431_019_9543_4
crossref_primary_10_1007_s40747_022_00770_1
crossref_primary_10_1109_TCNS_2020_3020972
crossref_primary_10_1109_TCNS_2025_3539580
crossref_primary_10_1109_TAC_2021_3056233
crossref_primary_10_1109_TNNLS_2023_3236607
crossref_primary_10_1002_int_22945
crossref_primary_10_1007_s11432_023_4034_2
crossref_primary_10_1109_TAC_2021_3079192
crossref_primary_10_1109_TCYB_2020_3022240
crossref_primary_10_1109_TSG_2020_3013303
crossref_primary_10_1109_TCYB_2019_2927725
crossref_primary_10_1109_TNSE_2021_3070398
crossref_primary_10_1109_ACCESS_2020_2964324
crossref_primary_10_1109_TIV_2022_3197951
crossref_primary_10_1109_TSMC_2019_2957156
crossref_primary_10_1109_TNSE_2022_3178107
crossref_primary_10_1109_TIE_2019_2960757
crossref_primary_10_1109_TAC_2023_3244995
crossref_primary_10_1016_j_jfranklin_2020_02_057
crossref_primary_10_1016_j_arcontrol_2019_05_006
crossref_primary_10_1109_TCST_2021_3058845
crossref_primary_10_1109_TMC_2023_3265646
crossref_primary_10_1109_TSMC_2023_3331334
crossref_primary_10_1016_j_neunet_2025_107257
crossref_primary_10_1109_JAS_2024_124935
crossref_primary_10_1109_JAS_2022_105872
crossref_primary_10_1109_TNSE_2020_3019195
crossref_primary_10_1016_j_neunet_2023_11_067
crossref_primary_10_1109_TCYB_2018_2883095
crossref_primary_10_1631_FITEE_2200596
crossref_primary_10_1016_j_automatica_2022_110358
crossref_primary_10_1109_TSMC_2019_2894862
crossref_primary_10_1109_TSMC_2019_2905248
crossref_primary_10_1109_JSYST_2020_3035059
crossref_primary_10_1109_TCSII_2020_2987947
crossref_primary_10_1109_TCSII_2024_3361085
crossref_primary_10_1109_TNNLS_2021_3071058
crossref_primary_10_1109_TAC_2020_3008113
crossref_primary_10_1109_JIOT_2024_3362587
crossref_primary_10_1109_TAC_2023_3347328
crossref_primary_10_1109_TAC_2023_3293521
crossref_primary_10_1109_ACCESS_2022_3191909
crossref_primary_10_1007_s11432_020_3111_4
crossref_primary_10_1109_TCOMM_2020_3027032
crossref_primary_10_1109_TCNS_2020_3027787
crossref_primary_10_1109_TCSI_2022_3167790
crossref_primary_10_1016_j_jfranklin_2021_11_034
crossref_primary_10_1007_s11768_023_00181_8
crossref_primary_10_1007_s00521_021_06026_2
crossref_primary_10_1016_j_automatica_2023_111339
crossref_primary_10_1016_j_ins_2021_02_049
crossref_primary_10_1109_TASE_2024_3508878
crossref_primary_10_1002_rnc_6041
crossref_primary_10_1016_j_neunet_2024_106525
crossref_primary_10_1109_TAC_2023_3266018
crossref_primary_10_1109_LCSYS_2020_3004764
crossref_primary_10_1016_j_automatica_2021_109737
crossref_primary_10_1109_TII_2020_2996198
crossref_primary_10_1109_TAC_2024_3515732
crossref_primary_10_1109_LCSYS_2020_3006822
crossref_primary_10_1016_j_automatica_2021_109899
crossref_primary_10_1016_j_apenergy_2022_118620
crossref_primary_10_1109_TCYB_2021_3055206
crossref_primary_10_1109_TAC_2022_3198113
Cites_doi 10.1109/TCSI.2004.830694
10.1137/1.9781611971309
10.1109/TAC.2012.2228038
10.1016/j.automatica.2013.09.031
10.1109/CDC.2012.6425904
10.1109/TAC.2008.2009515
10.1137/100784163
10.1109/TNNLS.2017.2652478
10.1080/10556788.2010.511669
10.1109/TNNLS.2013.2244908
10.1109/TNNLS.2016.2549566
10.1109/TNN.2011.2109735
10.1016/j.automatica.2015.03.001
10.3182/20140824-6-ZA-1003.01647
10.1016/j.automatica.2015.11.014
10.1109/CDC.2015.7402233
10.1109/ALLERTON.2010.5706956
10.1162/089976604322860730
10.1109/CDC.2011.6161503
10.1109/MCS.2008.919306
10.1007/978-3-319-19072-3
10.1109/TSP.2014.2367458
10.1109/TAC.2014.2308612
10.1109/TAC.2016.2610945
10.1109/TAC.2011.2167817
10.1109/TAC.2015.2416927
10.1109/TCSI.2008.920131
10.1109/TAC.2013.2278132
10.1016/j.sysconle.2015.06.006
10.1109/TSMCB.2011.2140395
10.1515/9781400841059
10.1109/TNNLS.2015.2481006
10.1109/TAC.2016.2604324
10.1017/CBO9780511804441
10.1561/2200000016
10.1109/TAC.2010.2041686
10.1109/TAC.2012.2184199
10.1109/TCYB.2015.2464255
10.1109/TNN.2004.824425
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1109/TAC.2018.2852602
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering 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
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2523
EndPage 1701
ExternalDocumentID 10_1109_TAC_2018_2852602
8401915
Genre orig-research
GrantInformation_xml – fundername: Hong Kong Research Grants Council
  grantid: U 11200317
– fundername: National Ten Thousand Talent Program for Young Top-Notch Talents
  grantid: W2070082
– fundername: National Science Foundation
  grantid: ECCS-1611423
  funderid: 10.13039/100000001
– fundername: Jiangsu Provincial Key Laboratory of Networked Collective Intelligence
  grantid: BM2017002
– fundername: National Natural Science Foundation of China
  grantid: 61673107; 61673104; 61528301; 61722303
  funderid: 10.13039/501100001809
– fundername: Science and Technology Project of State Grid Zhejiang Electric Power Co., Ltd
  grantid: 5211JY17000P
– fundername: Natural Science Foundation of Jiangsu Province
  grantid: BK20170079
  funderid: 10.13039/501100004608
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
F5P
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
VH1
VJK
~02
AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
RIG
ID FETCH-LOGICAL-c291t-f4c7fd1e6edb6f317c309fa6f35ad7bf992f2081d227ea416d6238a59964e5ed3
IEDL.DBID RIE
ISICitedReferencesCount 93
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000463066600032&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9286
IngestDate Mon Jun 30 10:21:33 EDT 2025
Tue Nov 18 21:45:25 EST 2025
Sat Nov 29 05:40:50 EST 2025
Wed Aug 27 02:48:32 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
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-c291t-f4c7fd1e6edb6f317c309fa6f35ad7bf992f2081d227ea416d6238a59964e5ed3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-1381-7418
0000-0001-7980-6282
0000-0002-2818-9752
0000-0003-0070-8597
0000-0003-3755-179X
PQID 2200828842
PQPubID 85475
PageCount 8
ParticipantIDs crossref_citationtrail_10_1109_TAC_2018_2852602
crossref_primary_10_1109_TAC_2018_2852602
ieee_primary_8401915
proquest_journals_2200828842
PublicationCentury 2000
PublicationDate 2019-04-01
PublicationDateYYYYMMDD 2019-04-01
PublicationDate_xml – month: 04
  year: 2019
  text: 2019-04-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on automatic control
PublicationTitleAbbrev TAC
PublicationYear 2019
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 ref35
ref34
ref12
ref37
ref15
ref31
cortés (ref43) 2008; 28
ref30
ref33
ref11
zhu (ref13) 0
ref32
ref10
ruszczy?ski (ref2) 2006
xue (ref6) 2008; 55
ref1
ref39
ref17
ref38
ref16
yu (ref41) 2017
horn (ref40) 1990
ref19
ref18
liu (ref8) 2011; 41
aubin (ref44) 2012
ref24
ref23
ref26
ref25
ref20
ref42
ref22
ref21
niederländer (ref36) 2016
ref28
ref27
ref29
ref7
ref9
ref4
ref3
ref5
zhu (ref14) 2012; 57
References_xml – ident: ref3
  doi: 10.1109/TCSI.2004.830694
– ident: ref42
  doi: 10.1137/1.9781611971309
– ident: ref16
  doi: 10.1109/TAC.2012.2228038
– ident: ref18
  doi: 10.1016/j.automatica.2013.09.031
– ident: ref25
  doi: 10.1109/CDC.2012.6425904
– ident: ref11
  doi: 10.1109/TAC.2008.2009515
– ident: ref17
  doi: 10.1137/100784163
– year: 2012
  ident: ref44
  publication-title: Differential Inclusions Set-Valued Maps and Viability Theory
– ident: ref34
  doi: 10.1109/TNNLS.2017.2652478
– ident: ref15
  doi: 10.1080/10556788.2010.511669
– year: 2017
  ident: ref41
  publication-title: Cooperative Control of Distributed Multi-agent Systems[M]
– ident: ref9
  doi: 10.1109/TNNLS.2013.2244908
– ident: ref38
  doi: 10.1109/TNNLS.2016.2549566
– ident: ref7
  doi: 10.1109/TNN.2011.2109735
– ident: ref30
  doi: 10.1016/j.automatica.2015.03.001
– ident: ref26
  doi: 10.3182/20140824-6-ZA-1003.01647
– ident: ref23
  doi: 10.1016/j.automatica.2015.11.014
– ident: ref21
  doi: 10.1109/CDC.2015.7402233
– ident: ref28
  doi: 10.1109/ALLERTON.2010.5706956
– ident: ref5
  doi: 10.1162/089976604322860730
– ident: ref31
  doi: 10.1109/CDC.2011.6161503
– volume: 28
  start-page: 36
  year: 2008
  ident: ref43
  article-title: Discontinuous dynamical Systems: A tutorial on solutions, nonsmooth analysis, and stability
  publication-title: IEEE Control Syst Mag
  doi: 10.1109/MCS.2008.919306
– ident: ref19
  doi: 10.1007/978-3-319-19072-3
– ident: ref27
  doi: 10.1109/TSP.2014.2367458
– ident: ref20
  doi: 10.1109/TAC.2014.2308612
– ident: ref39
  doi: 10.1109/TAC.2016.2610945
– volume: 57
  start-page: 151
  year: 2012
  ident: ref14
  article-title: On distributed convex optimization under inequality and equality constraints
  publication-title: IEEE Trans Autom Control
  doi: 10.1109/TAC.2011.2167817
– ident: ref37
  doi: 10.1109/TAC.2015.2416927
– volume: 55
  start-page: 2378
  year: 2008
  ident: ref6
  article-title: Subgradient-based neural networks for smooth convex optimization problems
  publication-title: IEEE Trans Circuits Syst I Regular Papers
  doi: 10.1109/TCSI.2008.920131
– ident: ref35
  doi: 10.1109/TAC.2013.2278132
– ident: ref32
  doi: 10.1016/j.sysconle.2015.06.006
– volume: 41
  start-page: 1323
  year: 2011
  ident: ref8
  article-title: A one-layer recurrent neural network for constrained nonsmooth optimization
  publication-title: IEEE Trans Syst Man Cybern Part B Cybernetics
  doi: 10.1109/TSMCB.2011.2140395
– year: 2016
  ident: ref36
  article-title: Distributed coordination for nonsmooth convex optimization via saddle-point dynamics
– year: 2006
  ident: ref2
  publication-title: Nonlinear Optimization
  doi: 10.1515/9781400841059
– start-page: 4863
  year: 0
  ident: ref13
  article-title: On distributed optimization under inequality constraints via lagrangian primal-dual methods
  publication-title: Proc American Control Conf
– ident: ref10
  doi: 10.1109/TNNLS.2015.2481006
– ident: ref33
  doi: 10.1109/TAC.2016.2604324
– year: 1990
  ident: ref40
  publication-title: Matrix Analysis
– ident: ref1
  doi: 10.1017/CBO9780511804441
– ident: ref24
  doi: 10.1561/2200000016
– ident: ref12
  doi: 10.1109/TAC.2010.2041686
– ident: ref29
  doi: 10.1109/TAC.2012.2184199
– ident: ref22
  doi: 10.1109/TCYB.2015.2464255
– ident: ref4
  doi: 10.1109/TNN.2004.824425
SSID ssj0016441
Score 2.5854611
Snippet The distributed convex optimization problem is studied in this paper for any fixed and connected network with general constraints. To solve such an...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1694
SubjectTerms Algorithms
Computational geometry
Computer simulation
Continuous-time subgradient algorithm
Convergence
Convex analysis
Convex functions
Convexity
distributed convex optimization
Hierarchies
Indexes
Linear programming
Multi-agent systems
multiagent systems
nonsmooth analysis
Optimization
Protocols
Signal processing algorithms
Title Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints
URI https://ieeexplore.ieee.org/document/8401915
https://www.proquest.com/docview/2200828842
Volume 64
WOSCitedRecordID wos000463066600032&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: 1558-2523
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0016441
  issn: 0018-9286
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwED1BxQADXwVRvuSBBYm0wU1qZ6wKiAkYQLBFjn2BSrRFbYr4-dw5aQQCIbFZih1ZfvH5XXz3DuBEK6OMow0YSsMlzDIOArC9wGKU6QzRujj3xSbUzY1-ekruluCszoVBRB98hm1u-rt8N7Fz_lXWIWeE3It4GZaVUmWuVn1jwOd6aXVpA0tdX0mGSee-P-AYLt2WOib6Lr8dQb6myg9D7E-Xq43_zWsT1isWKfol7FuwhONtWPuiLdiEjHWnhuM5efYB53mIC5bI5epW6ASZi-epD_YqRP_1eTIdFi8jQfxVDDgK_UPckiUZVSma4pGeikqfmjvMfF2JYrYDD1eX94ProCqoEFiZnBdBHlmVu3PsISffEXOw3TDJDTVj41SWJ4nMJXEEJ6VCQ1TNETnShhVcIozRdXehMZ6McQ9EROPY9aFlzyKne9oaZzG0cVfprjNhCzqLNU5tpTbOk3tNvdcRJimhkjIqaYVKC07rEW-l0sYffZuMQt2vAqAFhwsY02orzlIpvUyfjuT-76MOYJXenZThOIfQKKZzPIIV-14MZ9Nj_5V9AtUY0T4
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fb9MwED6NMonxMDbKRKEwP_AyibSpmzTOY9VRDVEKD53Wt8ixL6NSf6A0Rfvzd-ek0aYhJN4sxVYsf_H5u_juO4BPKtKRtrQBfam5hFnKQQBm4BkMUpUiGhtmrthENJ2q-Tz-eQCf61wYRHTBZ9jhprvLtxuz419lXXJGyL0In8HzMAhkr8zWqu8M-GQv7S5tYanqS0k_7s6GI47iUh2pQiLw8tEh5KqqPDHF7nwZv_q_mZ3AccUjxbAE_hQOcP0aXj5QF2xCyspTi_WOfHuPMz3EJYvkcn0rtIIMxm3uwr0KMVzebvJF8WsliMGKEceh34kfZEtWVZKmuKGnolKo5g5bV1mi2L6B6_GX2ejKq0oqeEbGvcLLAhNltocD5PQ74g6m78eZpmaobZRmcSwzSSzBShmhJrJmiR4pzRouAYZo-2fQWG_W-BZEQOPY-aFlTwOrBspoa9A3YT9Sfav9FnT3a5yYSm-cJ7dMnN_hxwmhkjAqSYVKCy7qEb9LrY1_9G0yCnW_CoAWtPcwJtVm3CZSOqE-Fch3fx91Di-uZt8nyeTr9Nt7OKL3xGVwThsaRb7DD3Bo_hSLbf7RfXH33u_UhQ
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=Continuous-Time+Distributed+Subgradient+Algorithm+for+Convex+Optimization+With+General+Constraints&rft.jtitle=IEEE+transactions+on+automatic+control&rft.au=Zhu%2C+Yanan&rft.au=Yu%2C+Wenwu&rft.au=Wen%2C+Guanghui&rft.au=Chen%2C+Guanrong&rft.date=2019-04-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9286&rft.eissn=1558-2523&rft.volume=64&rft.issue=4&rft.spage=1694&rft_id=info:doi/10.1109%2FTAC.2018.2852602&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9286&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9286&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9286&client=summon