The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Lectures on Stochastic Programming: Modeling and Theory
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 Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Acceleration of Stochastic Approximation by Averaging
Polyak, B. T., & Juditsky, A. B. (1992) · SIAM Journal on Control and Optimization · doi:10.1137/0330046 · Cited by 1,827 · cited 2×
“The robust SA approach was developed in Polyak [188] and Polyak and Juditsky [189].”
MethodShapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10006-0 · Cited by 916 · cited 4×
“Alexander Shapiro, Darinka Dentcheva, and Andrzej Ruszczyński i i “SPbook” — 2013/12/24 — 8:37 — page vi — #6 i i i i i i i i “SPbook” — 2013/12/24 — 8:37 — page vii — #7 i i i i i i Contents Preface iii”
BackgroundInfluentialSelf-citation
Cited by
Pyomo: modeling and solving mathematical programs in Python
Hart, W. E., Watson, J.-P., & Woodruff, D. L. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0026-8 · Cited by 1,201
Stochastic Model Predictive Control: An Overview and Perspectives for Future Research
(2016) · IEEE Control Systems · doi:10.1109/mcs.2016.2602087 · Cited by 923
Pyomo — Optimization Modeling in Python
Bynum, M. L., Hackebeil, G. A., Hart, W. E., Laird, C. D., Nicholson, B. L., Siirola, J. D., Watson, J.-P., & Woodruff, D. L. (2021) · Springer Optimization and Its Applications · doi:10.1007/978-3-030-68928-5 · Cited by 806
The Big Data Newsvendor: Practical Insights from Machine Learning
Ban, G.-Y., & Rudin, C. (2019) · Operations Research · doi:10.1287/opre.2018.1757 · Cited by 507
Data-driven chance constrained stochastic program
Jiang, R., & Guan, Y. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0929-7 · Cited by 485
Joudeh, H., & Clerckx, B. (2016) · IEEE Transactions on Communications · doi:10.1109/tcomm.2016.2603991 · Cited by 432
A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality
Campi, M. C., & Garatti, S. (2011) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9754-6 · Cited by 398
The scenario approach for systems and control design
Campi, M. C., Garatti, S., & Prandini, M. (2009) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2009.07.001 · Cited by 367
Fachrizal, R., Shepero, M., van der Meer, D., Munkhammar, J., & Widén, J. (2020) · eTransportation · doi:10.1016/j.etran.2020.100056 · Cited by 291
Machine Learning and Portfolio Optimization
Ban, G.-Y., El Karoui, N., & Lim, A. E. B. (2018) · Management Science · doi:10.1287/mnsc.2016.2644 · Cited by 282
Zhang, Y., Shen, S., & Mathieu, J. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2016.2572104 · Cited by 278
Data-Driven Aerospace Engineering: Reframing the Industry with Machine Learning
Brunton, S. L., Nathan Kutz, J., Manohar, K., Aravkin, A. Y., Morgansen, K., Klemisch, J., Goebel, N., Buttrick, J., Poskin, J., Blom-Schieber, A. W., et al. (2021) · AIAA Journal · doi:10.2514/1.j060131 · Cited by 270
A Guide to Sample Average Approximation
Kim, S., Pasupathy, R., & Henderson, S. G. (2015) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4939-1384-8_8 · Cited by 268
Joint Optimization of Hybrid Energy Storage and Generation Capacity With Renewable Energy
Yang, P., & Nehorai, A. (2014) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2014.2313724 · Cited by 254
Towards the fast and robust optimal design of wireless body area networks
D’Andreagiovanni, F., & Nardin, A. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.04.037 · Cited by 73
Smoothed -Minimization for Green Cloud-RAN With User Admission Control
Shi, Y., Cheng, J., Zhang, J., Bai, B., Chen, W., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2544578 · Cited by 70
Robust Group Sparse Beamforming for Multicast Green Cloud-RAN With Imperfect CSI
Shi, Y., Zhang, J., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2442957 · Cited by 63
Optimal Stochastic Coordinated Beamforming for Wireless Cooperative Networks With CSI Uncertainty
Shi, Y., Zhang, J., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2385669 · Cited by 61
Communication-Efficient Distributed Optimization of Self-Concordant Empirical Loss
Zhang, Y., & Xiao, L. (2015) · arXiv · doi:10.48550/arxiv.1501.00263 · Cited by 55
Large-scale methods for distributionally robust optimization
Levy, D., Carmon, Y., Duchi, J. C., & Sidford, A. (2020) · arXiv · doi:10.48550/arxiv.2010.05893 · Cited by 52
“The dual expression of CVaR simplifies to [67, Example 6.16] It also has a simple closed-form expression in terms of the inverse cdf of (cid:96) ( x ; S ) [67, Theorem 6.2]: We note that this last expression is a direct consequence of (14), since R is the set of measures never exceeding 1 α .”
BackgroundInfluentialBootstrap Robust Prescriptive Analytics
Bertsimas, D., & Van Parys, B. (2017) · arXiv · doi:10.48550/arxiv.1711.09974 · Cited by 51
Metadata
- Authors
- Shapiro, A., Dentcheva, D., & Ruszczyński, A.
- Venue
- Society for Industrial and Applied Mathematics eBooks
- Published
- 2009-01
- OpenAlex
- W4247165901
- Cited by
- 1,403
- References
- 3
- FWCI
- 31.57
- Type
- book
- 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.