activity
20122025
most citedDynamic Max-Consensus and Size Estimation of Anonymous Multi-Agent Networks

51 citations · 102 across the 15 of their papers we have counts for

collaborators
Showing math.OCShow all

6 papers · 1 filter

math.OC2025★ 2 cited

Optimization and Learning in Open Multi-Agent Systems

Diego Deplano, Nicola Bastianello, Mauro Franceschelli +1

Modern artificial intelligence relies on networks of agents that collect data, process information, and exchange it with neighbors to collaboratively solve optimization and learnin…

math.OC2024

Accelerated Alternating Direction Method of Multipliers Gradient Tracking for Distributed Optimization

Eduardo Sebastián, Mauro Franceschelli, Andrea Gasparri +2

This paper presents a novel accelerated distributed algorithm for unconstrained consensus optimization over static undirected networks. The proposed algorithm combines the benefits…

math.OC2023★ 13 cited

Robust Online Learning over Networks

Nicola Bastianello, Diego Deplano, Mauro Franceschelli +1

The recent deployment of multi-agent networks has enabled the distributed solution of learning problems, where agents cooperate to train a global model without sharing their local,…

math.OC2020★ 51 cited

Dynamic Max-Consensus and Size Estimation of Anonymous Multi-Agent Networks

Diego Deplano, Mauro Franceschelli, Alessandro Giua

In this paper we propose a novel consensus protocol for discrete-time multi-agent systems (MAS), which solves the dynamic consensus problem on the max value, i.e., the dynamic max-…

math.OC2016★ 1 cited

A duality-based approach for distributed min-max optimization

Ivano Notarnicola, Mauro Franceschelli, Giuseppe Notarstefano

In this paper we consider a distributed optimization scenario in which a set of processors aims at cooperatively solving a class of min-max optimization problems. This set-up is mo…

math.OC2015★ 2 cited

Consensus on the average in arbitrary directed network topologies with time-delays

Mehran Zareh, Carla Seatzu, Mauro Franceschelli

In this preliminary paper we study the stability property of a consensus on the average algorithm in arbitrary directed graphs with respect to communication/sensing time-delays. Th…