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

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

An optimal method for stochastic composite optimization

Lan, Guanghui · 2012 · Mathematical Programming

Overview

Integrity signals

Registry

Crossref · 10.1007/s10107-010-0434-y

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

We couldn’t retrieve this paper’s full text, 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 55 references

Research works printed but not linked: 4

  1. Kushner H., Yin J., Shapiro G.: Approximation and Recursive Algorithms and Applications, vol. 35 of Applications of Mathematics. Springer, New York (2003)
  2. Peña J.: Nash equilibria computation via smoothing techniques. Optima 78, 12–13 (2008)
  3. Polyak B.T.: New stochastic approximation type procedures. Automat. i Telemekh 7, 98–107 (1990)
  4. Tseng P.: On Accelerated Proximal Gradient Methods for Convex-Concave Optimization, Manuscript. University of Washington, Seattle (May 2008)

Cited by

See all 444

Metadata

Authors
Lan, G.
Affiliations
University of Florida (US)
Corresponding author
Lan, Guanghui
Venue
Mathematical Programming
Published
2011-01-01
Volume
133
Issue
1-2
Pages
365-397
ISSN
  • 0025-5610 (ISSN-L)
  • 1436-4646
OpenAlex
W2024484010
Cited by
427
References
55
Citations by year
2026: 13 · 2025: 14 · 2024: 20 · 2023: 23 · 2022: 25 · 2021: 47 · 2020: 45 · 2019: 40 · 2018: 40 · 2017: 43 · 2016: 30 · 2015: 20 · 2014: 29 · 2013: 14 · 2012: 11
FWCI
10.80
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
Mathematical Programming (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
  • Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
Keywords
convex optimization, mirror descent, stochastic approximation, convergence rate, lower bounds, nonsmooth optimization, stochastic programming, optimal algorithms

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: An optimal method for stochastic composite optimization. https://app.cochat.ai/papers/10.1007/s10107-010-0434-y
The paper
Lan, G. (2012). An optimal method for stochastic composite optimization. Mathematical Programming. https://doi.org/10.1007/s10107-010-0434-y

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.