Publication

Distributed Coupled Learning Over Adaptive Networks

Related publications (105)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Linear convergence of primal-dual gradient methods and their performance in distributed optimization

Ali H. Sayed, Sulaiman A S A E Alghunaim

In this work, we revisit a classical incremental implementation of the primal-descent dual-ascent gradient method used for the solution of equality constrained optimization problems. We provide a short proof that establishes the linear (exponential) conver ...

PERGAMON-ELSEVIER SCIENCE LTD2020

A positive combinatorial formula for symplectic Kostka-Foulkes polynomials I: Rows

Thomas Gerber

We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To show this, we construct a new algorithm for computing cocyclage in terms of wh ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2020

Exploiting structure of chance constrained programs via submodularity

Maryam Kamgarpour, Tony Alan Wood

We introduce a novel approach to reduce the computational effort of solving convex chance constrained programs through the scenario approach. Instead of reducing the number of required scenarios, we directly minimize the computational cost of the scenario ...

2019

Analysis of output modifier adaptation for real-time optimization

Dominique Bonvin, Alejandro Gabriel Marchetti

In the context of real-time optimization, modifier-adaptation schemes update the model-based optimization problem by adding first-order correction terms to the cost and constraint functions of the optimization problem. This guarantees meeting the plant fir ...

PERGAMON-ELSEVIER SCIENCE LTD2019

Learning Generalized Nash Equilibria in a Class of Convex Games

Maryam Kamgarpour

We consider multiagent decision making where each agent optimizes its convex cost function subject to individual and coupling constraints. The constraint sets are compact convex subsets of a Euclidean space. To learn Nash equilibria, we propose a novel dis ...

2019

A broad class of convex optimization problems can be formulated as a semidefinite program (SDP), minimization of a convex function over the positive-semidefinite cone subject to some affine constraints. The majority of classical SDP solvers are designed fo ...

2019

, ,

This work presents and studies a distributed algorithm for solving optimization problems over networks where agents have individual costs to minimize subject to subspace constraints that require the minimizers across the network to lie in a low-dimensional ...

IEEE2019

Distribution Network Restoration in a Multiagent Framework Using a Convex OPF Model

Hossein Sekhavatmanesh

The ever-increasing requirement for reliability and quality of supply suggests to enable the self-healing features of modern distribution networks employing the intelligent measurement, communication, and control facilities of smart grids. In this paper, t ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

This paper investigates reverse auctions that involve continuous values of different types of goods, general nonconvex constraints, and second stage costs. We seek to design the payment rules and conditions under which coalitions of participants cannot inf ...

2019

Accelerated and adaptive modifier-adaptation schemes for the real-time optimization of uncertain systems

Dominique Bonvin, René Uwe Schneider, Predrag Milosavljevic

The steady-state performance of a parametrically or structurally uncertain system can be optimized using iterative real-time optimization methods such as modifier adaptation. Here, we extend a recently proposed second-order modifier-adaptation scheme in tw ...

ELSEVIER SCI LTD2019