{'fraction_non_alphanumeric': 0.007352941176470588, 'fraction_numerical': 0.0, 'mean_word_length': 5.196969696969697, '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}}
A smooth vector field for saddle point problems

In this paper we propose a novel smooth vector field whose trajectories globally converge to the saddle point of the Lagrangian associated with a convex and constrained optimization problem. Under suitable assumptions, we prove global convergence of the trajectories for the class of strictly convex problems and we propose a vector field for linear programs.