{'fraction_non_alphanumeric': 0.016412661195779603, 'fraction_numerical': 0.0, 'mean_word_length': 5.62015503875969, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Application of Convex Relaxation to Array Synthesis Problems

A general procedure to solve efficiently non convex array synthesis problems is presented. It is based on the SemiDefinite Relaxation (SDR) technique. The way to properly relax the constraints in order to formulate the synthesis of shaped beams, phase-only arrays and reconfigurable arrays as semidefinite programming problems is detailed. These so-approximated array synthesis problems are then convex, easy to implement and can be efficiently solved using off-the-shelf numerical routines. The conditions under which the relaxed problems provide the optimal solution to the original non convex synthesis problems are specified. Various representative numerical comparisons with arrays designed by other approaches show the validity of the proposed method and illustrate its potentialities.