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.
Distributionally robust stochastic knap- sackproblem.SIAM Journal on Optimization, 24:1485–1506
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Unified framework for complex zero-sum games with chance constraints that converts probabilistic constraints into convex second-order cone programs under various distribution assumptions.
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.
-
Robust Chance Constrained Complex Zero-Sum Games
Unified framework for complex zero-sum games with chance constraints that converts probabilistic constraints into convex second-order cone programs under various distribution assumptions.