返回
Continuous-Time Algorithm for Approximate Distributed Optimization With Affine Equality and Convex Inequality Constraints
DOI:10.1109/TSMC.2019.2957156.png)
摘要
En 中文
A distributed optimization problem (DOP) with affine equality and convex inequality constraints is studied in this article. First, the consensus constraint of the considered DOP is relaxed and a related approximate DOP (ADOP) is presented. It is proved that the optimal solutions of the ADOP (i.e., the near-optimal solutions of the original DOP) are able to approach the optimal solutions of the original DOP. A continuous-time algorithm is proposed for the ADOP and it is demonstrated that the state solution of the presented algorithm converges to the critical point set of the ADOP with general locally Lipschitz continuous objective functions. This means the presented algorithm is efficient for distributed nonconvex optimization problems. Particularly, when the objective functions are convex ones, the state solution of the presented algorithm is further proved to converge to a near-optimal solution of the original DOP. One illustrative example and an application on load sharing problems are shown to validate the effectiveness of the proposed algorithm.
Keyword:
Optimization
Directed graphs
Approximation algorithms
Linear programming
Nickel
Distributed algorithms
Power systems
Constrained distributed optimization
continuous-time algorithm
near-optimal solutions
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation
AUTOMATICA
IF5.9
Distributed continuous-time approximate projection protocols for shortest distance optimization problems
AUTOMATICA
IF5.9
A Continuous-Time Algorithm for Distributed Optimization Based on Multiagent Networks基于多agent网络的连续时间分布式优化算法
Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints求解一般约束凸优化问题的连续时间分布次梯度算法

