Framework transforms complex chance-constrained problems into convex SOCPs for individual constraints and uses copulas for joint constraints under moment, support, and data-driven ambiguity sets, demonstrated on beamforming.
Convex approximations of random constrained markov decision processes.SIAM Journal on Optimiza- tion, 35(3):1703–1730, 2025
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributionally Robust Complex Chance-Constrained Optimization
Framework transforms complex chance-constrained problems into convex SOCPs for individual constraints and uses copulas for joint constraints under moment, support, and data-driven ambiguity sets, demonstrated on beamforming.