Conference paper · 2019 · Open access

A Randomized Block Subgradient Approach to Distributed Big Data Optimization

Francesco Farina, Giuseppe Notarstefano

IEEE Conference on Decision and Control (CDC), 147, 6362–6367 · Published 1 December 2019 · DOI 10.1109/cdc40024.2019.9030156

Read the free full textView at the publisherCite this paper

In brief

“A Randomized Block Subgradient Approach to Distributed Big Data Optimization” is a 2019 conference paper by Francesco Farina and Giuseppe Notarstefano, published in IEEE Conference on Decision and Control (CDC). OpenAlex counts 4 citations as of 15 November 2026. It is open access: the full text is free to read at Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna).

Citations
4
Most cited in
2020 (3)
Field-weighted impact
1.40
References
18
Authors
2

Abstract

This paper introduces a novel distributed algorithm over static directed graphs for solving big data convex optimization problems in which the dimension of the decision variable can be extremely high and the objective function can be nonsmooth. In the proposed algorithm nodes in the network update and communicate only blocks of their current solution estimate rather than the entire vector. The algorithm consists of two main steps: a consensus step and a subgradient update on a single block of the optimization variable (which is then broadcast to neighbors). Agents are shown to asymptotically achieve consensus by studying a block-wise consensus protocol over random graphs. Then convergence to the optimal cost is proven in expected value by exploiting the consensus of agents estimates and randomness of the algorithm. Finally, as a numerical example, a distributed linear classification problem is solved by means of the proposed algorithm.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Farina, F., & Notarstefano, G. (2019). A Randomized Block Subgradient Approach to Distributed Big Data Optimization. IEEE Conference on Decision and Control (CDC), 147, 6362–6367. https://doi.org/10.1109/cdc40024.2019.9030156

MLA 9

Farina, Francesco, and Giuseppe Notarstefano. “A Randomized Block Subgradient Approach to Distributed Big Data Optimization.” IEEE Conference on Decision and Control (CDC), vol. 147, 2019, pp. 6362–6367. https://doi.org/10.1109/cdc40024.2019.9030156.

Chicago

Farina, Francesco and Giuseppe Notarstefano. 2019. “A Randomized Block Subgradient Approach to Distributed Big Data Optimization.” IEEE Conference on Decision and Control (CDC) 147: 6362–6367. https://doi.org/10.1109/cdc40024.2019.9030156.

Harvard

Farina, F. and Notarstefano, G. (2019) ‘A Randomized Block Subgradient Approach to Distributed Big Data Optimization’, IEEE Conference on Decision and Control (CDC), 147, pp. 6362–6367. doi:10.1109/cdc40024.2019.9030156.

IEEE

F. Farina and G. Notarstefano, “A Randomized Block Subgradient Approach to Distributed Big Data Optimization,” IEEE Conference on Decision and Control (CDC), vol. 147, pp. 6362–6367, 2019, doi: 10.1109/cdc40024.2019.9030156.

BibTeX

@inproceedings{farina2019randomized,
  title     = {{A Randomized Block Subgradient Approach to Distributed Big Data Optimization}},
  author    = {Farina, Francesco and Notarstefano, Giuseppe},
  booktitle = {IEEE Conference on Decision and Control (CDC)},
  year      = {2019},
  volume    = {147},
  pages     = {6362--6367},
  doi       = {10.1109/cdc40024.2019.9030156},
  url       = {https://doi.org/10.1109/cdc40024.2019.9030156}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems

  • distributed optimization
  • big data optimization
  • subgradient method
  • random graphs
  • directed graphs
  • nonsmooth convex optimization
  • high-dimensional optimization
  • convergence analysis

Work with this paper

Most-cited papers in Engineering

All highly cited Engineering papers

Questions about this paper

How do I cite this paper in APA style?

Farina, F., & Notarstefano, G. (2019). A Randomized Block Subgradient Approach to Distributed Big Data Optimization. IEEE Conference on Decision and Control (CDC), 147, 6362–6367. https://doi.org/10.1109/cdc40024.2019.9030156

How many times has this paper been cited?

4 times, according to OpenAlex on 15 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access: read the free full text at Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna).

Who wrote this paper?

Francesco Farina, Giuseppe Notarstefano.

What is the DOI of this paper?

10.1109/cdc40024.2019.9030156. The permanent link is https://doi.org/10.1109/cdc40024.2019.9030156.

Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.