109 citations · 430 across the 61 of their papers we have counts for
28 papers · 1 filter
Exploiting Agent Symmetries for Performance Analysis of Distributed Optimization Methods
Sebastien Colla, Julien M. Hendrickx
We show that, in many settings, the worst-case performance of a distributed optimization algorithm is independent of the number of agents in the system, and can thus be computed in…
On the Optimal Communication Weights in Distributed Optimization Algorithms
Sebastien Colla, Julien M. Hendrickx
We establish that in distributed optimization, the prevalent strategy of minimizing the second-largest eigenvalue modulus (SLEM) of the averaging matrix for selecting communication…
Combinatorial Characterization for Global Identifiability of Separable Networks with Partial Excitation and Measurement
Antoine Legat, Julien M. Hendrickx
This work focuses on the generic identifiability of dynamical networks with partial excitation and measurement: a set of nodes are interconnected by transfer functions according to…
Nonlinear network identifiability: The static case
Renato Vizuete, Julien M. Hendrickx
We analyze the problem of network identifiability with nonlinear functions associated with the edges. We consider a static model for the output of each node and by assuming a perfe…
Interpolation Constraints for Computing Worst-Case Bounds in Performance Estimation Problems
Anne Rubbens, Nizar Bousselmi, Sebastien Colla +1
The Performance Estimation Problem (PEP) approach consists in computing worst-case performance bounds on optimization algorithms by solving an optimization problem: one maximizes a…
Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
Nizar Bousselmi, Julien M. Hendrickx, François Glineur
The Performance Estimation Problem methodology makes it possible to determine the exact worst-case performance of an optimization method. In this work, we generalize this framework…