We address constraint-coupled optimization for a system composed of multiple cooperative agents communicating over a time-varying network. We propose a distributed proximal minimization algorithm that is guaranteed to converge to an optimal solution of the optimization problem, under suitable convexity and connectivity assumptions. The performance of the introduced algorithm is shown on a numerical example of a charging scheduling problem for a fleet of plug-in electric vehicles.
A Distributed Dual Proximal Minimization Algorithm for Constraint-Coupled Optimization Problems
Falsone A.;Prandini M.
2021-01-01
Abstract
We address constraint-coupled optimization for a system composed of multiple cooperative agents communicating over a time-varying network. We propose a distributed proximal minimization algorithm that is guaranteed to converge to an optimal solution of the optimization problem, under suitable convexity and connectivity assumptions. The performance of the introduced algorithm is shown on a numerical example of a charging scheduling problem for a fleet of plug-in electric vehicles.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
proximal_dual.pdf
Open Access dal 01/02/2023
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
713.16 kB
Formato
Adobe PDF
|
713.16 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
