The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
First-order methods of smooth convex optimization with inexact oracle
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Self-citationIntroductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Self-citationSmooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Self-citation(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
Minimization Methods for Non-Differentiable Functions
Shor, N. Z. (1985) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-82118-9 · Cited by 1,551
Problem complexity and method efficiency in optimization
(1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90101-0 · Cited by 1,329
Gradient methods for minimizing composite functions
Nesterov, Y. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0629-5 · Cited by 1,298
Self-citationSimulation-based Econometric Methods
Gouriéroux, C., & Monfort, A. (1997) · doi:10.1093/0198774753.001.0001 · Cited by 1,038
Gradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
Self-citationProblem Complexity and Method Efficiency in Optimization
Darzentas, J., Nemirovsky, A., & Yudin, D. B. (1984) · Journal of the Operational Research Society · doi:10.2307/2581380 · Cited by 650
A Mathematical View of Interior-Point Methods in Convex Optimization
Renegar, J. (2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718812 · Cited by 631
An optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427 · cited 1×
“Remark 6 Our analysis is in a certain sense similar to that of [8], where the author applies a version of FGM to a stochastic composite optimization problem.”
MethodIndustrial Organization: Markets and Strategies
Belleflamme, P., & Peitz, M. (2010) · Cited by 405
Potential Function Methods for Approximately Solving Linear Programming Problems
(2002) · International Series in Operations Research & Management Science · doi:10.1007/b115460 · Cited by 291
Ghadimi, S., & Lan, G. (2012) · SIAM Journal on Optimization · doi:10.1137/110848864 · Cited by 269
Economic Geography: The Integration of Regions and Nations
van Tongeren, F. (2010) · European Review of Agricultural Economics · doi:10.1093/erae/jbq005 · Cited by 268
Smooth Optimization with Approximate Gradient
d'Aspremont, A. (2008) · SIAM Journal on Optimization · doi:10.1137/060676386 · Cited by 168
Smoothing Technique and its Applications in Semidefinite Optimization
Nesterov, Y. E. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0001-8 · Cited by 140
Self-citationEconomics of CitiesPreprint
Huriot, J.-M., & Thisse, J. (2000) · RePEc: Research Papers in Economics · Cited by 140
The effect of deterministic noise in subgradient methods
Nedić, A., & Bertsekas, D. P. (2009) · Mathematical Programming · doi:10.1007/s10107-008-0262-5 · Cited by 68
Cited by
Fast Distributed Gradient Methods
Jakovetic, D., Xavier, J., & Moura, J. M. F. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2298712 · Cited by 624
Harnessing Smoothness to Accelerate Distributed Optimization
Qu, G., & Li, N. (2018) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2017.2698261 · Cited by 565
Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
Lessard, L., Recht, B., & Packard, A. (2016) · SIAM Journal on Optimization · doi:10.1137/15m1009597 · Cited by 383
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Shalev-Shwartz, S., & Zhang, T. (2016) · Mathematical Programming · doi:10.1007/s10107-014-0839-0 · Cited by 360
Train faster, generalize better: Stability of stochastic gradient descent
Hardt, M., Recht, B., & Singer, Y. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1509.01240 · Cited by 323
Metadata
- Authors
- Devolder, O., Glineur, F., & Nesterov, Y.
- Venue
- Mathematical Programming
- Published
- 2013-06-14
- Volume
- 146
- Issue
- 1-2
- Pages
- 37-75
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2124768887
- Cited by
- 422
- References
- 20
- FWCI
- 28.32
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.