Convex Formulations for Antenna Array Pattern Optimization Through Linear, Quadratic, and Second-Order Cone Programming

This work presents a comprehensive study on formulations for the radiation pattern design of antenna arrays through convex optimization techniques, with a focus on linear, quadratic, and second-order cone programming. The proposed approaches heavily rely on the construction of Hermitian forms to systematically build convex optimization problems for synthesizing desired beam patterns while including practical constraints such as sidelobe levels (SLLs), maximum directivity, and null placement. By formulating the radiation pattern synthesis problem through a convex formulation, global optimality and computational efficiency are ensured. The paper introduces the mathematical foundations of the proposed methodologies, detailing the structure and benefits of each convex optimization model. Numerical examples demonstrate the effectiveness of the proposed methodologies in achieving high-performance radiation patterns for circular and planar arrays. The results highlight trade-offs between formulation complexity and pattern performance across different optimization models, providing valuable insights for antenna array pattern synthesis. Overall, this work underscores the potential of convex optimization in antenna array pattern synthesis methodologies.