This paper is concerned with a general class of distributed constrained optimization problems over a multi-agent network, where the global objective function is represented by the sum of all local objective functions. Each agent in the network only knows its own local objective function, and is restricted to a global non-empty closed convex set. We discuss the scenario where the communication of the whole multi-agent network is expressed as a sequence of time-varying general unbalanced directed graphs. The directed graphs are required to be uniformly jointly strongly connected and the weight matrices are only rowstochastic. To collaboratively deal with the optimization problems, existing distributed methods mostly require the communication graph to be fixed or balanced, which is impractical and hardly inevitable. In contrast, we propose a new distributed projection subgradient algorithm which is applicable to the time-varying general unbalanced directed graphs and does not need each agent to know its in-neighbors' out-degree. When the objective functions are convex and Lipschitz continuous, it is proved that the proposed algorithm exactly converges to the optimal s
13 January 2020 in IEEE Transactions on Network Science and Engineering
In this paper, the economic dispatch problem (EDP) in smart grids is investigated over a directed network, which concentrates on allocating the generation power among the generators to satisfy the load demands with minimal total generation cost while complying with all constraints of local generation capacity. Each generator possesses its own local generation cost, and the total generation cost is the sum of all local generation costs. To deal with EDP, most of the existing methods, such as strategy based on push-sum, surmount the unbalancedness induced by the directed network via employing column-stochastic weights, which might be infeasible in distributed implementation. In contrast, in order to be suitable for the directed network with row-stochastic weights, we develop a novel directed distributed Lagrangian momentum algorithm, named as D-DLM, which integrates distributed gradient tracking method with two types of momentum terms and utilizes non-uniform step-sizes with respect to the updates of Lagrangian multipliers. If the largest step-size and the maximum momentum coefficient are positive and sufficiently small, D-DLM can linearly allocate the optimal dispatch on condition that the generation costs are smooth and strongly convex. Finally, a variety of studies on EDP in smart grids are simulated.
18 June 2018 in IEEE Transactions on Network Science and Engineering
In this paper, we discuss a class of distributed constrained optimization problems in power systems where the target is to optimize the sum of all agents' local convex objective functions over a general unbalanced directed communication network. Each local convex objective function is known exclusively to a single agent, and the agents' variables are constrained to global coupling linear constraint and individual box constraints. To collaboratively solve the optimization problems, existing distributed methods mostly require the communication network to be balanced or have the knowledge of in-neighbors' out-degree for all agents, which are quite restrictive and hardly inevitable in practical applications. In contrast, we investigate a novel distributed primal-dual augmented (sub)gradient algorithm which utilizes a row-stochastic matrix (does not need each agent to know its in-neighbors out-degree) and employs uncoordinated step-sizes, and yet exactly converges to the optimal solution over a general unbalanced directed communication network. Under the assumptions of the strong convexity and smoothness on the aggregate objective functions, it is proved that the algorithm geometrically converges to the optimal solution if the uncoordinated step-sizes do not exceed the upper bound. An explicit analysis for the convergence rate of the proposed algorithm is also characterized. To manifest effectiveness and applicability of the proposed algorithm, three case studies are presented to solve two practical problems in power systems.
This article investigates the problem of distributed online optimization for a group of units communicating on time-varying unbalanced directed networks. The main target of the set of units is to cooperatively minimize the sum of all locally known convex cost functions (global cost function) while pursuing the privacy of their local cost functions being well masked. To address such optimization problems in a collaborative and distributed fashion, a differentially private-distributed stochastic subgradient-push algorithm, called DP-DSSP, is proposed, which ensures that units interact with in-neighbors and collectively optimize the global cost function. Unlike most of the existing distributed algorithms which do not consider privacy issues, DP-DSSP via differential privacy strategy successfully masks the privacy of participating units, which is more practical in applications involving sensitive messages, such as military affairs or medical treatment. An important feature of DP-DSSP is tackling distributed online optimization problems under the circumstance of time-varying unbalanced directed networks. Theoretical analysis indicates that DP-DSSP can effectively mask differential privacy as well as can achieve sublinear regrets. A compromise between the privacy levels and the accuracy of DP-DSSP is also revealed. Furthermore, DP-DSSP is capable of handling arbitrarily large but uniformly bounded delays in the communication links. Finally, simulation experiments confirm the practicability of DP-DSSP and the findings in this article.
27 April 2018 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
This paper studies a class of distributed convex optimization problems by a set of agents in which each agent only has access to its own local convex objective function and the estimate of each agent is restricted to both coupling linear constraint and individual box constraints. Our focus is to devise a distributed primal-dual gradient algorithm for working out the problem over a sequence of time-varying general directed graphs. The communications among agents are assumed to be uniformly strongly connected. A column-stochastic mixing matrix and a fixed step-size are applied in the algorithm which exactly steers all the agents to asymptotically converge to a global optimal solution. Based on the standard strong convexity and the smoothness assumptions of the objective functions, we show that the distributed algorithm is capable of driving the whole network to geometrically converge to an optimal solution of the convex optimization problem only if the step-size does not exceed some upper bound. We also give an explicit analysis for the convergence rate of the proposed optimization algorithm. Simulations on economic dispatch problems and demand response problems in power systems are performed to illustrate the effectiveness of the proposed optimization algorithm.
8 January 2020 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
In this article, we concentrate on dealing with the distributed optimization problem over a directed network, where each unit possesses its own convex cost function and the principal target is to minimize a global cost function (formulated by the average of all local cost functions) while obeying the network connectivity structure. Most of the existing methods, such as push-sum strategy, have eliminated the unbalancedness induced by the directed network via utilizing column-stochastic weights, which may be infeasible if the distributed implementation requires each unit to gain access to (at least) its out-degree information. In contrast, to be suitable for the directed networks with row-stochastic weights, we propose a new directed distributed Nesterov-like gradient tracking algorithm, named as D-DNGT, that incorporates the gradient tracking into the distributed Nesterov method with momentum terms and employs nonuniform step-sizes. D-DNGT extends a number of outstanding consensus algorithms over strongly connected directed networks. The implementation of D-DNGT is straightforward if each unit locally chooses a suitable step-size and privately regulates the weights on information that acquires from in-neighbors. If the largest step-size and the maximum momentum coefficient are positive and small sufficiently, we can prove that D-DNGT converges linearly to the optimal solution provided that the cost functions are smooth and strongly convex. We provide numerical experiments to confirm the findings in this article and contrast D-DNGT with recently proposed distributed optimization approaches.