{'fraction_non_alphanumeric': 0.022606382978723406, 'fraction_numerical': 0.0, 'mean_word_length': 5.605263157894737, '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}}
Guaranteed cost synthesis for polynomial systems using rational Lyapunov functions

A state-feedback synthesis problem for polynomial systems with guaranteed quadratic costs is addressed in this paper. Specifically, we focus on the local synthesis, that is, the closed-loop systems are assumed to be operated in a compact domain characterized by a semi-algebraic set. By means of rational Lyapunov functions, sufficient conditions for the synthesis problem can be formulated as state-dependent linear matrix inequalities (SDLMIs), which can be reformulated into standard LMIs using the sum-of-squares technique. Construction of alternative sufficient conditions with reduced computational cost for the synthesis problem is also discussed in this paper.