Subgradient Methods for Saddle-Point Problems
The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
The extragradient method for finding saddle points and other problems
Korpelevich, G. M. (1976) · Medical Entomology and Zoology · Cited by 2,779
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Convex Analysis and Minimization Algorithms I
Hiriart-Urruty, J.-B., & Lemaréchal, C. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02796-7 · Cited by 2,378
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Self-citationOptimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
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
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Mirror descent and nonlinear projected subgradient methods for convex optimization
Beck, A., & Teboulle, M. (2003) · Operations Research Letters · doi:10.1016/s0167-6377(02)00231-6 · Cited by 1,060
Studies in Linear and Non-Linear Programming.
Beale, E. M. L., Arrow, K. J., Hurwicz, L., Uzawa, H., Chenery, H. B., Johnson, S. M., Karlin, S., Marschak, T., & Solow, R. M. (1959) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2342801 · Cited by 915
Duclos-Lassalle, G. (2000) · Érudit (Université de Montréal) · Cited by 846
The Mathematics of Internet Congestion Control
Srikant, R. (2004) · Systems & Control: Foundations & Applications · doi:10.1007/978-0-8176-8216-3 · Cited by 800
Nemirovski, A. (2004) · SIAM Journal on Optimization · doi:10.1137/s1052623403425629 · Cited by 750
Incremental Subgradient Methods for Nondifferentiable Optimization
Nedic, A., & Bertsekas, D. P. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623499362111 · Cited by 589
Studies in Linear and Non-Linear Programming.
Suzuki, G., Arrow, K. J., Hurwicz, L., & Uzawa, H. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002823 · Cited by 520
Smith, D. K., & Bertsekas, D. P. (1997) · The Journal of the Operational Research Society · doi:10.2307/3010437 · Cited by 474
Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
Nedić, A., & Ozdaglar, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070708111 · Cited by 399
Self-citationStudies in Linear and Nonlinear Programming
Kunzi, H. P., Arrow, J. K., Hurwicz, L., & Uzawa, H. (1963) · Econometrica · doi:10.2307/1910003 · Cited by 337
Interior Gradient and Proximal Methods for Convex and Conic Optimization
Auslender, A., & Teboulle, M. (2006) · SIAM Journal on Optimization · doi:10.1137/s1052623403427823 · Cited by 269
Operations research proceedings
Pressmar, D., Jäger, K. E., & Krallmann, H. (1990) · European Journal of Operational Research · doi:10.1016/0377-2217(90)90174-a · Cited by 221
Stochastic Optimization: Algorithms and Applications
(2001) · Applied Optimization · doi:10.1007/978-1-4757-6594-6 · Cited by 198
Convergence Rate of Incremental Subgradient Algorithms
Nedić, A., & Bertsekas, D. (2001) · Applied Optimization · doi:10.1007/978-1-4757-6594-6_11 · Cited by 190
Self-citationBruck, R. E. (1977) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(77)90152-4 · Cited by 166
Primal-Dual Subgradient Methods for Convex ProblemsPreprint
Nesterov, Y. E. (2006) · SSRN Electronic Journal · doi:10.2139/ssrn.912637 · Cited by 48
Perturbation Methods for Saddle Point Computation
Kallio, M., & Ruszczyński, A. (1994) · IIASA PURE (International Institute of Applied Systems Analysis) · Cited by 28
Riccardi, A., Minisci, E. A., Akartunalı, K., Greco, C., Rutledge, N., Kershaw, A., & Hashim, A. (2020) · Springer eBooks · doi:10.1007/978-3-030-60166-9_7 · Cited by 14
Cited by
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Chambolle, A., & Pock, T. (2011) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-010-0251-1 · Cited by 4,336
Constrained Consensus and Optimization in Multi-Agent Networks
Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041686 · Cited by 2,086
Self-citationOn Distributed Convex Optimization Under Inequality and Equality Constraints
Zhu, M., & Martinez, S. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2167817 · Cited by 759
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium
Bynagari, N. B. (2019) · Asian Journal of Applied Science and Engineering · doi:10.18034/ajase.v8i1.9 · Cited by 513
Metadata
- Authors
- Nedić, A., & Ozdaglar, A.
- Venue
- Journal of Optimization Theory and Applications
- Published
- 2009-03-05
- Volume
- 142
- Issue
- 1
- Pages
- 205-228
- ISSN
- 0022-3239 (ISSN-L)
- 1573-2878
- OpenAlex
- W2020123437
- Cited by
- 438
- References
- 26
- FWCI
- 14.49
- 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.