Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 184

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

Distributed Random Projection Algorithm for Convex Optimization

Open access
Lee, Soomin, Nedic, Angelia · 2013 · IEEE Journal of Selected Topics in Signal Processing

Abstract

Random projection algorithm is of interest for constrained optimization when the constraint set is not known in advance or the projection operation on the whole constraint set is computationally prohibitive. This paper presents a distributed random projection algorithm for constrained convex optimization problems that can be used by multiple agents connected over a time-varying network, where each agent has its own objective function and its own constrained set. We prove that the iterates of all agents converge to the same point in the optimal set almost surely. Experiments on distributed support vector machines demonstrate good performance of the algorithm.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/jstsp.2013.2247023

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 8 references

Cited by

See all 184

Metadata

Authors
Lee, S., & Nedic, A.
Venue
IEEE Journal of Selected Topics in Signal Processing
Published
2013-04
Volume
7
Issue
2
Pages
221-229
ISSN
  • 1932-4553 (ISSN-L)
  • 1941-0484
OpenAlex
W2092507976
Cited by
184
References
8
FWCI
28.64
Type
journal article
Language
en
Open access
green

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: Distributed Random Projection Algorithm for Convex Optimization. https://app.cochat.ai/papers/10.1109/jstsp.2013.2247023
The paper
Lee, S., & Nedic, A. (2013). Distributed Random Projection Algorithm for Convex Optimization. IEEE Journal of Selected Topics in Signal Processing. https://doi.org/10.1109/jstsp.2013.2247023

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.