The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Random Gradient-Free Minimization of Convex Functions
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
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
Lagarias, J. C., Reeds, J. A., Wright, M. H., & Wright, P. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496303470 · Cited by 7,447
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-citationRobust Stochastic Approximation Approach to Stochastic Programming
Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070704277 · Cited by 1,945
Introduction to Derivative-Free Optimization
Conn, A. R., Scheinberg, K., & Vicente, L. N. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718768 · Cited by 1,840
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
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
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
Nesterov, Y. (2012) · SIAM Journal on Optimization · doi:10.1137/100802001 · Cited by 1,187
Self-citationSimulation-based Econometric Methods
Gouriéroux, C., & Monfort, A. (1997) · doi:10.1093/0198774753.001.0001 · Cited by 1,038
Woodhouse, C. (2024) · The Astrophotography Manual · doi:10.4324/9781003463108-19 · Cited by 1,037
Problem 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
Online convex optimization in the bandit setting: gradient descent without a gradient
Flaxman, A. D., Kalai, A. T., & McMahan, H. B. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408007 · Cited by 546
Industrial Organization: Markets and Strategies
Belleflamme, P., & Peitz, M. (2010) · Cited by 405
Multi-armed bandits in metric spaces
Kleinberg, R., Slivkins, A., & Upfal, E. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374475 · Cited by 396
Potential Function Methods for Approximately Solving Linear Programming Problems
(2002) · International Series in Operations Research & Management Science · doi:10.1007/b115460 · Cited by 291
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
Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback.
Agarwal, A., Dekel, O., & Xiao, L. (2010) · Cited by 261
Solving convex programs by random walks
Bertsimas, D., & Vempala, S. (2004) · Journal of the ACM · doi:10.1145/1008731.1008733 · Cited by 242
Stochastic Convex Optimization with Bandit Feedback
Agarwal, A., Foster, D. P., Hsu, D., Kakade, S. M., & Rakhlin, A. (2013) · SIAM Journal on Optimization · doi:10.1137/110850827 · Cited by 162
Economics of CitiesPreprint
Huriot, J.-M., & Thisse, J. (2000) · RePEc: Research Papers in Economics · Cited by 140
Random gradient-free minimization of convex functionsPreprint
Nesterov, Y. E. (2011) · RePEc: Research Papers in Economics · Cited by 89
Self-citationConvergence of the Restricted Nelder--Mead Algorithm in Two Dimensions
Lagarias, J. C., Poonen, B., & Wright, M. H. (2012) · SIAM Journal on Optimization · doi:10.1137/110830150 · Cited by 62
Finite Sample Convergence Rates of Zero-Order Stochastic Optimization Methods
Wibisono, A., Wainwright, M. J., Jordan, M. I., & Duchi, J. C. (2012) · neural information processing systems · Cited by 24
Cited by
Evolution Strategies as a Scalable Alternative to Reinforcement Learning
Salimans, T., Ho, J., Chen, X., Sidor, S., & Sutskever, I. (2017) · arXiv · doi:10.48550/arxiv.1703.03864 · Cited by 1,027
“Theoretical analysis indeed shows that for general non-smooth optimization problems, the required number of optimization steps scales linearly with the dimension [Nesterov and Spokoiny, 2011].”
FLTrust: Byzantine-robust Federated Learning via Trust Bootstrapping
Cao, X., Fang, M., Liu, J., & Gong, N. Z. (2021) · Proceedings 2021 Network and Distributed System Security Symposium · doi:10.14722/ndss.2021.24434 · Cited by 999
Black-box Adversarial Attacks with Limited Queries and Information
Ilyas, A., Engstrom, L., Athalye, A., & Lin, J. (2018) · arXiv · doi:10.48550/arxiv.1804.08598 · Cited by 806
Square Attack: A Query-Efficient Black-Box Adversarial Attack via Random Search
Andriushchenko, M., Croce, F., Flammarion, N., & Hein, M. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58592-1_29 · Cited by 800
HopSkipJumpAttack: A Query-Efficient Decision-Based Attack
Chen, J., Jordan, M. I., & Wainwright, M. J. (2020) · 2020 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp40000.2020.00045 · Cited by 718
Metadata
- Authors
- Nesterov, Y., & Spokoiny, V.
- Venue
- Foundations of Computational Mathematics
- Published
- 2015-11-30
- Volume
- 17
- Issue
- 2
- Pages
- 527-566
- ISSN
- 1615-3375 (ISSN-L)
- 1615-3383
- OpenAlex
- W2149479912
- Cited by
- 822
- References
- 26
- FWCI
- 19.39
- 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.