Conference paper · 2016 · Open access

Distributed nonconvex multiagent optimization over time-varying networks

Ying Sun, Gesualdo Scutari, Daniel P. Palomar

Asilomar Conference on Signals, Systems and Computers (ACSSC), 788–794 · Published 1 November 2016 · DOI 10.1109/acssc.2016.7869154

Free PDFView at the publisherCite this paper

In brief

“Distributed nonconvex multiagent optimization over time-varying networks” is a 2016 conference paper by Ying Sun and 2 co-authors, published in Asilomar Conference on Signals, Systems and Computers (ACSSC). OpenAlex counts 89 citations as of 15 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
89
Most cited in
2019 (21)
Field-weighted impact
23.29
References
30
Authors
3

Abstract

We study nonconvex distributed optimization in multiagent networks where the communications between nodes is modeled as a time-varying sequence of arbitrary digraphs. We introduce a novel broadcast-based distributed algorithmic framework for the (constrained) minimization of the sum of a smooth (possibly nonconvex and nonseparable) function, i.e., the agents' sum-utility, plus a convex (possibly nonsmooth and nonseparable) regularizer. The latter is usually employed to enforce some structure in the solution, typically sparsity. The proposed method hinges on Successive Convex Approximation (SCA) techniques coupled with i) a tracking mechanism instrumental to locally estimate the gradients of agents' cost functions; and ii) a novel broadcast protocol to disseminate information and distribute the computation among the agents. Asymptotic convergence to stationary solutions is established. A key feature of the proposed algorithm is that it neither requires the double-stochasticity of the consensus matrices (but only column stochasticity) nor the knowledge of the graph sequence to implement. To the best of our knowledge, the proposed framework is the first broadcast-based distributed algorithm for convex and nonconvex constrained optimization over arbitrary, time-varying digraphs. Numerical results show that our algorithm outperforms current schemes on both convex and nonconvex problems.

Cite this paper

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

APA 7

Sun, Y., Scutari, G., & Palomar, D. P. (2016). Distributed nonconvex multiagent optimization over time-varying networks. Asilomar Conference on Signals, Systems and Computers (ACSSC), 788–794. https://doi.org/10.1109/acssc.2016.7869154

MLA 9

Sun, Ying, et al. “Distributed nonconvex multiagent optimization over time-varying networks.” Asilomar Conference on Signals, Systems and Computers (ACSSC), 2016, pp. 788–794. https://doi.org/10.1109/acssc.2016.7869154.

Chicago

Sun, Ying, Gesualdo Scutari, and Daniel P. Palomar. 2016. “Distributed nonconvex multiagent optimization over time-varying networks.” Asilomar Conference on Signals, Systems and Computers (ACSSC): 788–794. https://doi.org/10.1109/acssc.2016.7869154.

Harvard

Sun, Y., Scutari, G. and Palomar, D. P. (2016) ‘Distributed nonconvex multiagent optimization over time-varying networks’, Asilomar Conference on Signals, Systems and Computers (ACSSC), pp. 788–794. doi:10.1109/acssc.2016.7869154.

IEEE

Y. Sun, G. Scutari, and D. P. Palomar, “Distributed nonconvex multiagent optimization over time-varying networks,” Asilomar Conference on Signals, Systems and Computers (ACSSC), pp. 788–794, 2016, doi: 10.1109/acssc.2016.7869154.

BibTeX

@inproceedings{sun2016distributed,
  title     = {{Distributed nonconvex multiagent optimization over time-varying networks}},
  author    = {Sun, Ying and Scutari, Gesualdo and Palomar, Daniel P.},
  booktitle = {Asilomar Conference on Signals, Systems and Computers (ACSSC)},
  year      = {2016},
  pages     = {788--794},
  doi       = {10.1109/acssc.2016.7869154},
  url       = {https://doi.org/10.1109/acssc.2016.7869154}
}

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

Citations by year

YearCitationsShare of the best year
201788
20182020
20192121
20201414
202155
202244
202333
202477
202511
202655

Its field-weighted citation impact is 23.29: it has been cited 23.29 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

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

  • distributed optimization
  • non-convex optimization
  • multi-agent systems
  • successive convex approximation
  • gradient tracking
  • constrained optimization
  • convergence to stationary solutions

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?

Sun, Y., Scutari, G., & Palomar, D. P. (2016). Distributed nonconvex multiagent optimization over time-varying networks. Asilomar Conference on Signals, Systems and Computers (ACSSC), 788–794. https://doi.org/10.1109/acssc.2016.7869154

How many times has this paper been cited?

89 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 arXiv (Cornell University).

Who wrote this paper?

Ying Sun, Gesualdo Scutari, Daniel P. Palomar.

What is the DOI of this paper?

10.1109/acssc.2016.7869154. The permanent link is https://doi.org/10.1109/acssc.2016.7869154.

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.