{'fraction_non_alphanumeric': 0.03058623619371283, 'fraction_numerical': 0.0008496176720475786, 'mean_word_length': 5.581005586592179, '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}}
Successive convex approximation for system performance optimization in a multiuser network with multiple mimo relays

We consider the problem of jointly optimizing amplify-and-forward (AF) multiple-input multiple-output (MIMO) relays and single-antenna receivers for multipoint-to-multipoint (MP2MP) communications using weighted summean-square-error (MSE) as a system performance measure. This optimization problem is nonconvex and the optimal solution cannot be obtained in polynomial time. By applying first-order approximation for the quadratic term, we show that this problem can be approximately reformulated as a semidefinite programming (SDP) problem, which is then solved successively in an iterative way. The performance of the proposed scheme is compared with the lower bound (LB) of the global optimal solution that is obtained with increased complexity using the MSE-profile approach, and the bisection and semidefinite relaxation (SDR) techniques. Numerical results show that the performance of the proposed successive convex approximation (SCA) approach is very close to the LB of the global optimal solution and is much better than the zero-forcing MIMO relays.