Chance-Constrained Optimization with Complex Variables (2504.03028v1)

Abstract: Optimization problems involving complex variables, when solved, are typically transformed into real variables, often at the expense of convergence rate and interpretability. This paper introduces a novel formalism for a prominent problem in stochastic optimization involving complex random variables, termed the Complex Chance-Constrained Problem (CCCP). The study specifically examines the linear CCCP under complex normal distributions for two scenarios: one with individual probabilistic constraints and the other with joint probabilistic constraints. For the individual case, the core methodology reformulates the CCCP into a deterministic Second-Order Cone Programming (SOCP) problem, ensuring equivalence to the original CCCP. For the joint case, an approximation is achieved by deriving suitable upper and lower bounds, which also leads to a SOCP formulation. Finally, numerical experiments on a signal processing application, specifically the Minimum Variance Beamforming problem with mismatch using MVDR, demonstrate that the proposed formalism outperforms existing approaches in the literature. A comparative analysis between the joint and individual CCCP cases is also included.