An Enhanced Distributed Optimization Subject to Multiple Constraints: A Case Study on Entire Ethylene Separation Process

This article studies an enhanced distributed optimization algorithm in an undirected topology based on local communication and computation to optimize the sum of local objective functions under multiple constraints. In particular, the adapt-then-combine distributed inexact gradient tracking algorith...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on control of network systems Vol. 12; no. 2; pp. 1227 - 1237
Main Authors Liu, Bing, Du, Wenli, Li, Zhongmei
Format Journal Article
LanguageEnglish
Published Piscataway IEEE 01.06.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This article studies an enhanced distributed optimization algorithm in an undirected topology based on local communication and computation to optimize the sum of local objective functions under multiple constraints. In particular, the adapt-then-combine distributed inexact gradient tracking algorithm (ATC-DIGing-MC) is developed for smooth and strongly convex local functions with multiple constraints. By implementing the adapt-then-combine scheme and using the gradient tracking technique, rapidity and flexibility can be obtained by the ATC-DIGing-MC with uncoordinated step-sizes. Subsequently, the parameter projection strategy is implemented to deal with realistic production limitations in the presence of multiple constraints. Meanwhile, rigorous theoretical proofs and convergence theorem are provided to verify the geometrical convergence rate of the ATC-DIGing-MC. Furthermore, the numerical experiments based on the entire ethylene separation process validate the superior performance of the ATC-DIGing-MC algorithm in terms of time and energy savings compared to established algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2325-5870
2372-2533
DOI:10.1109/TCNS.2025.3539580