Return
Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints
DOI:10.1109/TAC.2018.2852602.png)
Abstract
En 中文
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.
Keywords:
Continuous-time subgradient algorithm
distributed convex optimization
multiagent systems
nonsmooth analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
Observations on the Optical Deportment of the Atmosphere in Reference to the Phenomena of Putrefaction and Infection
BMJ
IF0
Integrated Optimization Design of Combined Cooling, Heating, and Power System Coupled with Solar and Biomass Energy
Energies
IF0
On distributed constrained formation control in operator-vehicle adversarial networks
AUTOMATICA
IF5.9

