Exponentially Convergent Algorithms Design for Distributed Resource Allocation Under Non-Strongly Convex Condition: From Continuous-Time to Event-Triggered Communication
- 30 December 2024
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Cyber-Physical Systems
- Vol. 3, 127-138
Abstract
The standard condition for achieving exponential convergence of distributed resource allocation is the strongly convex objective functions, which is hard to be guaranteed in many practical cyber-physical systems. To study the resource allocation problem in a more general setting, we provide a new condition which only requires that the gradient-based map satisfies the metric subregularity. This condition is weaker than the standard strongly convex condition and is imposed to the objective functions. Based on such a relaxed condition, two new kinds of distributed allocation algorithms are proposed under continuous-time and event-triggered communications, respectively. The exponential convergence of our proposed algorithms are verified by rigorous theoretical analyses and some economic dispatch examples in the industrial cyber-physical system.Keywords
Funding Information
- National Natural Science Foundation of China (62303206, 62163026)
- Natural Science Foundation of Jiangxi Province (20224BAB212019, 20224BAB212018, 20242BAB25086, 20242BAB25090)
- Natural Science Foundation of Chongqing Municipality (CSTB2024NSCQ-MSX0255)
This publication has 39 references indexed in Scilit:
- Exponential convergence of distributed optimization for heterogeneous linear multi-agent systems over unbalanced digraphsAutomatica, 2022
- Distributed least squares solver for network linear equationsAutomatica, 2020
- Exponential Convergence for Distributed Optimization Under the Restricted Secant Inequality ConditionIFAC-PapersOnLine, 2020
- Exponential convergence of distributed primal–dual convex optimization algorithm without strong convexityAutomatica, 2019
- Linear convergence of first order methods for non-strongly convex optimizationMathematical Programming, 2018
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systemsAutomatica, 2016
- Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition2016
- Stochastic sensor scheduling via distributed convex optimizationAutomatica, 2015
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communicationAutomatica, 2015
- Implicit Functions and Solution Mappings2014