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:	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
ISSN:	0018-9286, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!