The paper addresses the problem of multi-agent distributed solutions for a class of linear programming (LP) problems which include box constraints on the decision variables and inequality constraints. The major difference with existing literature on distributed solution of LP problems is that each agent is expected to compute only a single or few entries of the global minimizer vector, often referred as a partition-based optimization. This class of LP problems isrelevant in different applications such as optimal power transfer in remotely powered battery-less wireless sensor networks, minimum energy LED luminaries control in smart offices, and optimal temperature control in start buildings. Via a suitable approximation of the originalLP problem, we propose three different primal-dual distributed algorithms based on dual gradient ascent, on the methods of multipliers and on the Alternating Direction Methods of Multipliers.We discuss the computational and communication requirements of these methods and we provide numerical comparisons.

Multi-agent distributed optimization algorithms for partition-based linear programming (LP) problems / Carli, R.; Yildirim, K. S.; Schenato, L.. - (2018), pp. 1462-1467. (Intervento presentato al convegno 16th European Control Conference, ECC 2018 tenutosi a cyp nel 12-15 June, 2018) [10.23919/ECC.2018.8550623].

Multi-agent distributed optimization algorithms for partition-based linear programming (LP) problems

Yildirim K. S.;
2018-01-01

Abstract

The paper addresses the problem of multi-agent distributed solutions for a class of linear programming (LP) problems which include box constraints on the decision variables and inequality constraints. The major difference with existing literature on distributed solution of LP problems is that each agent is expected to compute only a single or few entries of the global minimizer vector, often referred as a partition-based optimization. This class of LP problems isrelevant in different applications such as optimal power transfer in remotely powered battery-less wireless sensor networks, minimum energy LED luminaries control in smart offices, and optimal temperature control in start buildings. Via a suitable approximation of the originalLP problem, we propose three different primal-dual distributed algorithms based on dual gradient ascent, on the methods of multipliers and on the Alternating Direction Methods of Multipliers.We discuss the computational and communication requirements of these methods and we provide numerical comparisons.
2018
2018 European Control Conference, ECC 2018
Limassol, Cyprus
Institute of Electrical and Electronics Engineers Inc.
978-3-9524-2698-2
Carli, R.; Yildirim, K. S.; Schenato, L.
Multi-agent distributed optimization algorithms for partition-based linear programming (LP) problems / Carli, R.; Yildirim, K. S.; Schenato, L.. - (2018), pp. 1462-1467. (Intervento presentato al convegno 16th European Control Conference, ECC 2018 tenutosi a cyp nel 12-15 June, 2018) [10.23919/ECC.2018.8550623].
File in questo prodotto:
File Dimensione Formato  
paper.pdf

Open Access dal 01/07/2020

Descrizione: Main article
Tipologia: Post-print referato (Refereed author’s manuscript)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 297.62 kB
Formato Adobe PDF
297.62 kB Adobe PDF Visualizza/Apri
08550623.pdf

Solo gestori archivio

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 351.55 kB
Formato Adobe PDF
351.55 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/254652
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact