{'fraction_non_alphanumeric': 0.010895883777239709, 'fraction_numerical': 0.0, 'mean_word_length': 5.616, '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 fast algorithm for solving large scale nonlinear optimization problems using RNN

This paper presents a discrete-time recurrent neural network (RNN) model for solving nonlinear differentiable constrained optimization problems, which contain the special case of convex optimizations over constrained sets and variational inequality problem. The qualitative analysis results about the regularity and completeness of the proposed network have been obtained. It is shown that all trajectories starting from any initial point in Rfrn converge to the equilibrium set of the recurrent system. This RNN model shows its great simplicity in contrast to other existing neural network solvers. Simulations for a class of large scale linear complementarity problems illustrate the fast convergence and features of the proposed RNN model.