A new approach to the optimization of robust antenna array processors

Abstract

The authors present a method for solving a class of optimization problems with nonsmooth constraints. In particular, they apply the method to the design of narrowband minimum-power antenna array processors which are robust in the presence of errors such as array element placement, look direction misalignment, and frequency offset. They first show that the constrained minimum power problem has a unique global minimum provided that the constraint set is nonempty. Then it is shown how the design problem derived directly from considerations of the sensitivity of the antenna array processor to errors can be transformed into a quadratic programming problem with linear inequality constraints which can be solved efficiently by the standard active set strategy. They also present numerical results for two types of nonsmooth constraints developed to provided robustness. These results confirm the effectiveness of the method.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>