Distributed Optimization for Quadratic Cost Functions With Quantized Communication and Finite-Time Convergence

Thumbnail Image

Files

Distributed_Optimization_for_Quadratic_Cost_Functions_With_Quantized_Communication_and_Finite-Time_Convergence.pdf (1012.77 KB)

Access rights

openAccess
CC BY
publishedVersion

URL

Journal Title

Journal ISSN

Volume Title

A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.

Authors

Date

2025

Department

Department of Electrical Engineering and Automation

Major/Subject

Mcode

Degree programme

Language

en

Pages

13

Series

IEEE Transactions on Control of Network Systems, Volume 12, issue 1, pp. 930-942

Abstract

In this article, we propose two distributed iterative algorithms that can be used to solve the distributed optimization problem for quadratic local cost functions over large-scale networks in finite time. The first algorithm exhibits synchronous operation while the second one exhibits asynchronous operation. Both algorithms operate exclusively with quantized values. This means that the information stored, processed, and exchanged between neighboring nodes is subject to deterministic uniform quantization. The algorithms rely on event-driven updates in order to reduce energy consumption, communication bandwidth, network congestion, and/or processor usage. Finally, once the algorithms converge, nodes distributively terminate their operation. We prove that our algorithms converge in a finite number of iterations to the exact optimal solution depending on the quantization level, and we present applications of our algorithms to, first, optimal task scheduling for data centers, and second, global model aggregation for distributed federated learning. We provide simulations of these applications to illustrate the operation, performance, and advantages of the proposed algorithms. In addition, it is shown that our proposed algorithms compare favorably to algorithms in the current literature.

Description

Publisher Copyright: © 2014 IEEE.

Keywords

Distributed algorithms, federated learning, finite-time, optimization, quantization, resource allocation

Other note

DOI

10.1109/TCNS.2024.3431413

Citation

Rikos, A I, Grammenos, A, Kalyvianaki, E, Hadjicostis, C N, Charalambous, T & Johansson, K H 2025, 'Distributed Optimization for Quadratic Cost Functions With Quantized Communication and Finite-Time Convergence', IEEE Transactions on Control of Network Systems, vol. 12, no. 1, pp. 930-942. https://doi.org/10.1109/TCNS.2024.3431413

Permanent link to this item

https://urn.fi/URN:NBN:fi:aalto-202504093154

Collections

[article-cris] Sähkötekniikan korkeakoulu / ELEC