CoChat

NEXT: In-Network Nonconvex Optimization

Lorenzo, Paolo Di, Scutari, Gesualdo · 2016 · IEEE Transactions on Signal and Information Processing over Networks

The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.

Abstract

We study nonconvex distributed optimization in multiagent networks with time-varying (nonsymmetric) connectivity. We introduce the first algorithmic framework for the distributed minimization of the sum of a smooth (possibly nonconvex and nonseparable) function-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 techniques while leveraging dynamic consensus as a mechanism to distribute the computation among the agents: each agent first solves (possibly inexactly) a local convex approximation of the nonconvex original problem, and then performs local averaging operations. Asymptotic convergence to (stationary) solutions of the nonconvex problem is established. Our algorithmic framework is then customized to a variety of convex and nonconvex problems in several fields, including signal processing, communications, networking, and machine learning. Numerical results show that the new method compares favorably to existing distributed algorithms on both convex and nonconvex problems.

Overview

Integrity signals

Registry

Crossref · 10.1109/tsipn.2016.2524588

Cites

57 of 57 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 57 references

Cited by

See all 473

Metadata

Authors
Lorenzo, P. D., & Scutari, G.
Affiliations
  • University of Perugia (IT)
  • Purdue University West Lafayette (US)
Venue
IEEE Transactions on Signal and Information Processing over Networks
Published
2016-06
Volume
2
Issue
2
Pages
120-136
ISSN
  • 2373-776X (ISSN-L)
  • 2373-7778
OpenAlex
W2266148951
Cited by
473
References
57
Citations by year
2026: 12 · 2025: 43 · 2024: 45 · 2023: 55 · 2022: 45 · 2021: 63 · 2020: 68 · 2019: 62 · 2018: 45 · 2017: 21 · 2016: 13
FWCI
44.34
Type
journal article
Language
en
Open access
closed
Locations
  • IEEE Transactions on Signal and Information Processing over Networks (publishedVersion)
  • IRIS Research product catalog (Sapienza University of Rome) (submittedVersion)
Funders
  • USA NSF (CIF 1564044)
  • CAREER (1555850)
  • ONR (N00014-16-1-2244)
Topics
  • Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed Sensor Networks and Detection Algorithms
  • Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
Keywords
multi-agent systems, time-varying connectedness, successive convex approximation, dynamic consensus, regularized optimization, sparsity, asymptotic convergence, in-network processing

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: NEXT: In-Network Nonconvex Optimization. https://app.cochat.ai/papers/10.1109/tsipn.2016.2524588
The paper
Lorenzo, P. D., & Scutari, G. (2016). NEXT: In-Network Nonconvex Optimization. IEEE Transactions on Signal and Information Processing over Networks. https://doi.org/10.1109/tsipn.2016.2524588

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.