TY - JOUR
T1 - Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation
AU - Liang, Shu
AU - Zeng, Xianlin
AU - Hong, Yiguang
N1 - Publisher Copyright:
© 2018 Elsevier Ltd
PY - 2018/9
Y1 - 2018/9
N2 - In this paper, we consider distributed optimization design for resource allocation problems over weight-balanced graphs. With the help of singular perturbation analysis, we propose a simple sub-optimal continuous-time optimization algorithm. Moreover, we prove the existence and uniqueness of the algorithm equilibrium, and then show the convergence with an exponential rate. Finally, we verify the sub-optimality of the algorithm, which can approach the optimal solution as an adjustable parameter tends to zero.
AB - In this paper, we consider distributed optimization design for resource allocation problems over weight-balanced graphs. With the help of singular perturbation analysis, we propose a simple sub-optimal continuous-time optimization algorithm. Moreover, we prove the existence and uniqueness of the algorithm equilibrium, and then show the convergence with an exponential rate. Finally, we verify the sub-optimality of the algorithm, which can approach the optimal solution as an adjustable parameter tends to zero.
KW - Distributed optimization
KW - Resource allocation
KW - Singular perturbation
KW - Sub-optimality
KW - Weight-balanced graph
UR - http://www.scopus.com/inward/record.url?scp=85048483605&partnerID=8YFLogxK
U2 - 10.1016/j.automatica.2018.05.013
DO - 10.1016/j.automatica.2018.05.013
M3 - Article
AN - SCOPUS:85048483605
SN - 0005-1098
VL - 95
SP - 222
EP - 228
JO - Automatica
JF - Automatica
ER -