Journal article · 2019 · Open access

Distributed nonconvex constrained optimization over time-varying digraphs

Gesualdo Scutari, Ying Sun

Mathematical Programming, 176(1-2), 497–544 · Published 16 February 2019 · DOI 10.1007/s10107-018-01357-w

Free PDFView at the publisherCite this paper

In brief

“Distributed nonconvex constrained optimization over time-varying digraphs” is a 2019 journal article by Gesualdo Scutari and Ying Sun, published in Mathematical Programming. OpenAlex counts 158 citations as of 15 November 2026, which puts it in the top 3% of works published in 2019 by citations. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
158
Most cited in
2022 (25)
Field-weighted impact
9.02
References
59
Authors
2

Cite this paper

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

APA 7

Scutari, G., & Sun, Y. (2019). Distributed nonconvex constrained optimization over time-varying digraphs. Mathematical Programming, 176(1-2), 497–544. https://doi.org/10.1007/s10107-018-01357-w

MLA 9

Scutari, Gesualdo, and Ying Sun. “Distributed nonconvex constrained optimization over time-varying digraphs.” Mathematical Programming, vol. 176, no. 1-2, 2019, pp. 497–544. https://doi.org/10.1007/s10107-018-01357-w.

Chicago

Scutari, Gesualdo and Ying Sun. 2019. “Distributed nonconvex constrained optimization over time-varying digraphs.” Mathematical Programming 176 (1-2): 497–544. https://doi.org/10.1007/s10107-018-01357-w.

Harvard

Scutari, G. and Sun, Y. (2019) ‘Distributed nonconvex constrained optimization over time-varying digraphs’, Mathematical Programming, 176(1-2), pp. 497–544. doi:10.1007/s10107-018-01357-w.

IEEE

G. Scutari and Y. Sun, “Distributed nonconvex constrained optimization over time-varying digraphs,” Mathematical Programming, vol. 176, no. 1-2, pp. 497–544, 2019, doi: 10.1007/s10107-018-01357-w.

BibTeX

@article{scutari2019distributed,
  title     = {{Distributed nonconvex constrained optimization over time-varying digraphs}},
  author    = {Scutari, Gesualdo and Sun, Ying},
  journal   = {Mathematical Programming},
  year      = {2019},
  volume    = {176},
  number    = {1-2},
  pages     = {497--544},
  doi       = {10.1007/s10107-018-01357-w},
  url       = {https://doi.org/10.1007/s10107-018-01357-w}
}

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

Citations by year

YearCitationsShare of the best year
201844
20191414
20202222
20211717
20222525
20232525
20241414
20252121
20261616

Its field-weighted citation impact is 9.02: it has been cited 9.02 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
  • constrained optimization
  • time-varying directed graphs
  • difference of convex functions
  • successive convex approximation
  • sublinear convergence
  • diminishing step size

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?

Scutari, G., & Sun, Y. (2019). Distributed nonconvex constrained optimization over time-varying digraphs. Mathematical Programming, 176(1-2), 497–544. https://doi.org/10.1007/s10107-018-01357-w

How many times has this paper been cited?

158 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?

Gesualdo Scutari, Ying Sun.

What is the DOI of this paper?

10.1007/s10107-018-01357-w. The permanent link is https://doi.org/10.1007/s10107-018-01357-w.

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.