arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2504.03028math.OCmath.PR
收藏

复变量机会约束优化

Chance-Constrained Optimization with Complex Variables

Raneem Madani, Abdel Lisser

AI总结:

本文提出复机会约束问题(CCCP)形式化方法,将个体概率约束转化为等价的二阶锥规划问题,联合概率约束通过上下界近似,并在MVDR波束成形实验中验证了优于现有方法。

摘要:

涉及复变量的优化问题在求解时通常转化为实变量,这往往以牺牲收敛速度和可解释性为代价。本文针对随机优化中涉及复随机变量的一个重要问题,提出了一种新颖的形式化方法,称为复机会约束问题(CCCP)。研究具体考察了复正态分布下的线性CCCP的两种场景:一种具有个体概率约束,另一种具有联合概率约束。对于个体情况,核心方法将CCCP重新表述为确定性的二阶锥规划(SOCP)问题,确保与原始CCCP等价。对于联合情况,通过推导合适的上下界实现了近似,这也导向了SOCP形式。最后,在信号处理应用上的数值实验,具体是使用MVDR的失配最小方差波束成形问题,表明所提出的形式化方法优于文献中的现有方法。文中还包含了联合与个体CCCP案例之间的比较分析。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑