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
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Recent advances in differential privacy for dynamic databases and time series data [143, 142, 97] have all assumed the existence of a trusted curator who can see raw data as they arrive online, and publish dynamically updated statistics.”
From Advances and Open Problems in Federated Learning (2021) · cites this paper as [97]
Citations
Cites
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643 · cited 1×
“The classic SA method mimics the gradient descent method and goes back to the pioneering paper by Robbins and Monro [42].”
MethodIntroductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
A method for solving the convex programming problem with convergence rate O(1/k^2)
Nesterov, Y. E. (1983) · Доклады Академии наук · Cited by 2,662
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455 · cited 11×
“Thirdly, while Nesterov’s optimal method and its variants [33, 35, 36 , 1, 20, 50] were designed for solving deterministic smooth convex optimization problems, the AC-SA algorithm described above is capable of solving non-smooth and stochastic convex optimization problems as well.”
BackgroundMethodInfluentialStochastic Programming: The State of the Art In Honor of George B. Dantzig
(2010) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-1642-6 · Cited by 2,239
Research works printed but not linked: 4
- Kushner H., Yin J., Shapiro G.: Approximation and Recursive Algorithms and Applications, vol. 35 of Applications of Mathematics. Springer, New York (2003)
- Peña J.: Nash equilibria computation via smoothing techniques. Optima 78, 12–13 (2008)
- Polyak B.T.: New stochastic approximation type procedures. Automat. i Telemekh 7, 98–107 (1990)
- Tseng P.: On Accelerated Proximal Gradient Methods for Convex-Concave Optimization, Manuscript. University of Washington, Seattle (May 2008)
Cited by
(2010) · Cited by 8,261
Advances and Open Problems in Federated Learning
Kairouz, P., & McMahan, H. B. (2021) · Foundations and Trends in Machine Learning · doi:10.1561/2200000083 · Cited by 7,772
“[49] J. Wang, A. Sahu, G. Joshi, and S. Kar, “MATCHA: Speeding up decentralized SGD via matching decomposition sampling,” Preprint, May 2019.”
MethodInfluential(2013) · Cited by 3,740
Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
Ghadimi, S., & Lan, G. (2013) · SIAM Journal on Optimization · doi:10.1137/120880811 · Cited by 1,034
Self-citationDual Averaging Method for Regularized Stochastic Learning and Online Optimization
Xiao, L. (2009) · Cited by 574
Metadata
- Authors
- Lan, G.
- Affiliations
- University of Florida (US)
- Corresponding author
- Lan, Guanghui
- ORCID
- 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.