International audienceIn a large network of agents, we consider a distributed convex optimization problem where each agent has a private convex cost function and a set of local variables. We provide an algorithm to carry out a multi-area decentralized optimization in an asynchronous fashion, obtained by applying random Gauss-Seidel iterations on the Douglas-Rachford splitting operator. As an application, a direct-current linear optimal power flow model is implemented and simulations results confirm the convergence of the proposed algorithm
Funding Information: This work was supported by the Academy of Finland under Grant 320043. The work ...
The optimal power flow (OPF) problem is fundamental to power system planing and operation. It is a n...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
International audienceIn a large network of agents, we consider a distributed convex optimization pr...
Abstract — Consider a set of networked agents endowed with private cost functions and seeking to fin...
International audienceBased on recent works on asynchronous versions of the distributed Alternating ...
The optimal power flow (OPF) problem, which playsa central role in operating electrical networks is ...
Funding Information: This work was supported by the Academy of Finland under Grant 320043. The work ...
International audienceThis article introduces a distributed convex optimization algorithm in a const...
International audienceWe consider the solution of the single commodity strictly convex network flow ...
We consider a network of agents that are cooperatively solving a global optimization problem, where ...
Distributed optimization approaches are gaining more attention for solving power systems energy mana...
In this article, we focus on the problem of minimizing the sum of convex cost functions in a distrib...
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
Abstract — The optimal power flow (OPF) problem is funda-mental in power system operations and plann...
Funding Information: This work was supported by the Academy of Finland under Grant 320043. The work ...
The optimal power flow (OPF) problem is fundamental to power system planing and operation. It is a n...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...
International audienceIn a large network of agents, we consider a distributed convex optimization pr...
Abstract — Consider a set of networked agents endowed with private cost functions and seeking to fin...
International audienceBased on recent works on asynchronous versions of the distributed Alternating ...
The optimal power flow (OPF) problem, which playsa central role in operating electrical networks is ...
Funding Information: This work was supported by the Academy of Finland under Grant 320043. The work ...
International audienceThis article introduces a distributed convex optimization algorithm in a const...
International audienceWe consider the solution of the single commodity strictly convex network flow ...
We consider a network of agents that are cooperatively solving a global optimization problem, where ...
Distributed optimization approaches are gaining more attention for solving power systems energy mana...
In this article, we focus on the problem of minimizing the sum of convex cost functions in a distrib...
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for a...
Abstract — The optimal power flow (OPF) problem is funda-mental in power system operations and plann...
Funding Information: This work was supported by the Academy of Finland under Grant 320043. The work ...
The optimal power flow (OPF) problem is fundamental to power system planing and operation. It is a n...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Comp...