The DOI matches its Crossref record.
Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
Abstract
When there is parameter uncertainty in the constraints of a convex optimization problem, it is natural to formulate the problem as a joint chance constrained program (JCCP), which requires that all constraints be satisfied simultaneously with a given large probability. In this paper, we propose to solve the JCCP by a sequence of convex approximations. We show that the solutions of the sequence of approximations converge to a Karush-Kuhn-Tucker (KKT) point of the JCCP under a certain asymptotic regime. Furthermore, we propose to use a gradient-based Monte Carlo method to solve the sequence of convex approximations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
Ning, C., & You, F. (2019) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.03.034 · Cited by 343
Monte Carlo sampling-based methods for stochastic optimization
Homem-de-Mello, T., & Bayraksan, G. (2014) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2014.05.001 · Cited by 283
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
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
Metadata
- Authors
- Hong, L. J., Yang, Y., & Zhang, L.
- Venue
- Operations Research
- Published
- 2011-06
- Volume
- 59
- Issue
- 3
- Pages
- 617-630
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2139869783
- Cited by
- 191
- References
- 0
- FWCI
- 15.17
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach. https://app.cochat.ai/papers/10.1287/opre.1100.0910
- The paper
- Hong, L. J., Yang, Y., & Zhang, L. (2011). Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach. Operations Research. https://doi.org/10.1287/opre.1100.0910
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.