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 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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Control of Network Systems
Published
2025-02-06
DOI
https://doi.org/10.1109/tcns.2025.3539580
Citations
1
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
1.49

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Wenli Du, Zhongmei Li, Bing Liu
1 citations
IEEE Transactions on Control of Network Systems
Distributed and Parallel Computing Systems
1.49
article

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

Wenli Du, Zhongmei Li, Bing Liu
article en
1 citations

Abstract

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.

IEEE Transactions on Control of Network SystemsVol. 12(2)
East China University of Science and Technology (CN)
National Natural Science Foundation of China, Shanghai Rising-Star Program, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 20%
Distributed and Parallel Computing Systems
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.