{'fraction_non_alphanumeric': 0.017838405036726127, 'fraction_numerical': 0.001049317943336831, 'mean_word_length': 5.235294117647059, '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}}
On bounded real matrix inequality dilation

We discuss a variation of dilated matrix inequalities for the conventional Bounded Real matrix inequality and other similarly structured inequalities. Here, system matrices are separated from Lyapunov matrix to allow the use of different Lyapunov matrices in multi-objective and robust problems. The search involves a bounded scalar parameter that enters the problem nonlinearly and is dealt with a line search. To demonstrate the benefits of the new dilated matrix inequalities over the conventional ones, an example of controller synthesis with ℒ2-gain performance measure (ℋ∞ control) for a system with polytopic uncertainty (robust problem) has been studied. It is shown that for the resulting robust problem the performance obtained via the dilated form is at least equal to that of the conventional one. Also, the connection between the proposed dilated form and the Full Block S-procedure is discussed.