Distributed Algorithm for Nonsmooth Resource Allocation Problems With Nonlinear Constraints and Its Application to Smart Grids

• Published in: IEEE systems journal Vol. 17; no. 2; pp. 1 - 10
• Main Authors: Deng, Zhenhua, Chen, Tao, Zhao, Yan
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.06.2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Computational geometry; Convergence; Convexity; Cost function; Costs; Distributed algorithms; Graph theory; Inclusions; multiagent systems; nonlinear constraints; nonsmooth analysis; Optimization; Power dispatch; Resource allocation; Resource management; Smart grid; Smart grids
• ISSN: 1932-8184; 1937-9234
• DOI: 10.1109/JSYST.2022.3228242

In this article, we study nondifferentiable resource allocation problems (RAPs). In our problem, the decisions of agents are subject to coupling inequality constraints, local inequality constraints, and local convex set constraints. In contrast to existing RAPs, the cost functions are nonsmooth and the inequality constraints are nonsmooth and nonlinear in our problem. Based on differential inclusions and projection methods, we exploit a fully distributed subgradient-based resource allocation algorithm to optimally allocate the network resources. With the help of the set-valued LaSalle invariance principle, we prove the global convergence of the algorithm to the optimal resource allocation of our problem. Finally, our method is applied to the economic dispatch problems of smart grids. With our method, the generations of generating units converge to the optimal power generation.