Abstract
By combining convex programming (CP) and particle swarm optimization (PSO), a hybrid method for the synthesis of excitations and locations of nonuniformly spaced linear subarrays to minimize the subarray number is proposed and discussed in this article. The synthesis problem herein is formulated as a CP problem by minimizing the l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> -norm with respect to the excitation variables, and the PSO procedure is carried out as far as location variables are concerned. Through collaborations like this, we can finally get the optimal solution in a global sense. A set of representative numerical experiments shows the effectiveness of this method with quite a number of subarrays saved when compared with the uniformly spaced layouts.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
