Abstract:This paper introduces a framework for Chance-Constrained Optimization with Complex Variables, addressing complex linear programming for both individual and joint probabilistic constraints in the complex domain. We first analyze the 3CP model in the density-based setting under the assumption that the random parameters follow a Complex Elliptically Symmetric distribution. The framework is then extended to distributionally robust settings, which include a moment-based model where the moments are known or bounded; a support-based model, where the ambiguity set contains distributions supported on norm-bounded uncertainty sets; and a data-driven model where moments are estimated empirically. The individual constraints are transformed into a convex deterministic second-order cone problem. We employ copula theory to the joint probability constraints and derive both upper and lower approximations. Finally, we demonstrate the proposed framework on the minimum variance distortionless response beamforming problem in signal processing. We further evaluate empirical out-of-sample rates and show that the observed behavior closely matches the prescribed probabilistic guarantees.
| Subjects: | Optimization and Control (math.OC) |
| Cite as: | arXiv:2605.23757 [math.OC] |
| (or arXiv:2605.23757v1 [math.OC] for this version) | |
| https://doi.org/10.48550/arXiv.2605.23757 arXiv-issued DOI via DataCite (pending registration) |
From: Raneem Madani [view email] [via CCSD proxy]
[v1]
Fri, 22 May 2026 15:29:44 UTC (2,576 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。