In this article, we study convex optimization problems where agents of a network cooperatively minimize the global objective function which consists of multiple local objective functions. The intention of this work is to solve large-scale optimization problems where the local objective function is complicated, and numerous. Different from most of the existing works, the local objective function of each agent is presented as the average of finite instantaneous functions. Integrating the gradient tracking algorithm with stochastic averaging gradient technology, a distributed stochastic gradient tracking (termed as S-DIGing) algorithm is proposed. At each time instant, only one randomly selected gradient of an instantaneous function is computed, and applied to approximate the local batch gradient for each agent. Based on a novel primal-dual interpretation of the S-DIGing algorithm, it is shown that the S-DIGing algorithm linearly converges to the global optimal solution when step-size do not exceed an explicit upper bound, and the instantaneous functions are strongly convex with Lipschitz continuous gradients. Numerical experiments are presented to demonstrate the practicability of the S-DIGing algorithm, and correctness of the theoretical results.
26 October 2021 in IEEE Transactions on Signal and Information Processing over Networks
Considering the extensive applications of the model predictive control (MPC), this paper investigates the MPC problem with an application to the optimal output consensus of high-order multi-agent systems. A synchronous distributed optimization algorithm for the MPC problem is proposed, and we further devise its asynchronous version. The algorithm allows agents to choose the uncoordinate step-sizes depending on local information, which improves the flexibility of multi-agent systems. The convergence of the proposed algorithm is guaranteed if the positive uncoordinate step-sizes satisfy the explicit conditions. Compared with the synchronous version that needs a global clock to control all agents for communication and update, the asynchronous algorithm does not require each agent in the multi-agent systems to update and communicate simultaneously, and also converges to the optimal global solution to the problem. The numerical simulations demonstrate the availability of the proposed algorithm and the validity of the theoretical results.
9 February 2024 in IEEE Transactions on Signal and Information Processing over Networks
This paper investigates the generalized Nash equilibria (GNE) seeking problem for noncooperative games, where all players dedicate to selfishly minimizing their own cost functions subject to local constraints and coupled constraints. To tackle the considered problem, we initially form an explicit local equilibrium condition for its variational formulation. By employing proximal splitting operators, a novel distributed primal-dual splitting algorithm with full-decision information (Dist_PDS_FuDeIn) is designed, eliminating the need for global step-sizes. Furthermore, to address scenarios where players lack access to all other players' decisions, a local estimation is introduced to approximate the decision information of other players, and a fully distributed primal-dual splitting algorithm with partial-decision information (Dist_PDS_PaDeIn) is then proposed. Both algorithms enable the derivation of new distributed forward-backward-like extensions. Theoretically, a new analytical approach for convergence is presented, demonstrating that the proposed algorithms converge to the variational GNE of games, and their convergence rates are also proven, provided that uncoordinated step-sizes are positive and less than explicit upper bounds. Moreover, the approach not only generalizes the forward-backward splitting technique but also improves convergence rates of several well-known algorithms. Finally, the advantages of Dist_PDS_FuDeIn and Dist_PDS_PaDeIn are illustrated through comparative simulations.
12 July 2023 in IEEE Transactions on Industrial Cyber-Physical Systems
It is projected that plug-in electric vehicles (PEVs) would steadily increase as household appliances. However, PEVs' high power consumption, stochastic usage patterns, and storage capacity will surely result in a rise in the elasticity of demand response and pose significant difficulties for price-based residential demand response management (PRDRM). This paper aims to optimize a two-tier globally shared nonconvex PRDRM problem with local constraints and PEVs, known as social welfare: maximizing retailer profits and minimizing the combined residential costs. This is done by balancing residential electricity use with retail electricity prices in an unknown market environment. The proposed online/offline model-free reinforcement learning-based economic dispatch (MFRL-ED) methods can adaptively decide on the ideal retail price sequence by integrating the daily residential-retailer behavior model with the agent-environment interaction method, providing a basic MFRL-ED solution for PRDRM without a system identification step and an accurate load-retail model. Experiments show that MFRL-ED methods provide an effective class of PRDRM solutions.
15 April 2025 in IEEE/CAA Journal of Automatica Sinica
Game theory-based models and design tools have gained substantial prominence for controlling and optimizing behavior within distributed engineering systems due to the inherent distribution of decisions among individuals. In non-cooperative settings, aggregative games serve as a mathematical framework model for the interdependent optimal decision-making problem among a group of non-cooperative players. In such scenarios, each player's decision is influenced by an aggregation of all players' decisions. Nash equilibrium (NE) seeking in aggregative games has emerged as a vibrant topic driven by applications that harness the aggregation property. This paper presents a comprehensive overview of the current research on aggregative games with a focus on communication topology. A systematic classification is conducted on distributed algorithm research based on communication topologies such as undirected networks, directed networks, and time-varying networks. Furthermore, it sorts out the challenges and compares the algorithms' convergence performance. It also delves into real-world applications of distributed optimization techniques grounded in aggregative games. Finally, it proposes several challenges that can guide future research directions.
30 January 2023 in IEEE Transactions on Signal and Information Processing over Networks
This paper focuses on the constrained optimization problem where the objective function is composed of smooth (possibly nonconvex) and nonsmooth parts. The proposed algorithm integrates the successive convex approximation (SCA) technique with the gradient tracking mechanism that aims at achieving a linear convergence rate and employing the momentum term to regulate update directions in each time instant. It is proved that the proposed algorithm converges provided that the constant step size and momentum parameter are lower than the given upper bounds. When the smooth part is strongly convex, the proposed algorithm linearly converges to the global optimal solution, whereas it converges to a local stationary solution with a sub-linear convergence rate if the smooth part is nonconvex. Numerical simulations are applied to demonstrate the validity of the proposed algorithm and the theoretical analysis.