Sparse array synthesis via sequential convex optimizations: Convened session — “Non-uniform array antennas”

An iterative procedure for the synthesis of sparse arrays radiating focused beampatterns is presented. The algorithm consists in solving a sequence of weighted l₁ convex optimization problems. The method can thus be readily implemented and efficiently solved. In the optimization procedure, the objective is the minimization of the number of radiating elements and the constraints correspond to the pattern requirements. The method can be applied to arbitrary arrays which means that there is no restriction regarding the array geometry and individual element patterns to be synthesized. Numerical comparisons with examples found in the literature assess the efficiency of the proposed approach, whose computation time is several orders of magnitude below those of so-called global optimization algorithms.