{'fraction_non_alphanumeric': 0.01019108280254777, 'fraction_numerical': 0.0, 'mean_word_length': 5.288, '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 projection based recurrent neural network approach to compute the distance between a point and an ellipsoid with box constraint

Here we proposed a projection based recurrent neural network for computing the distance between a point and an ellipsoid subject to box constraint. The proposed neural network makes use of a cost gradient projection onto the tangent space of the constraints and the well-known projection theorem. It can be proved that the neural network is stable. And the ability of globally converging to optimal solution within a finite time is also guaranteed. Global convergence analysis is established for nonconvex-constrained optimization problems. Numerical simulation is performed to illustrated the performance of this recurrent neural network model proposed.