{'fraction_non_alphanumeric': 0.015463917525773196, 'fraction_numerical': 0.0, 'mean_word_length': 5.368852459016393, '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 Method of Two New Augmented Lagrange Multiplier Versions for Solving Constrained Problems

One of the more restrictive methods of improvement is the augmented Lagrange method. Two versions are built in the external framework and the internal framework of the proposed method. The first basic version of the proposed algorithm includes a new derivation of Lagrange multiples and different penalty criteria, and the second version is the internal framework in which the unconstrained algorithm known as the conjugate gradient (CG) method was incorporated; also, a new parameter was derived in the search direction. The numerical results are indicative of the stability, efficiency, and speed of the proposed algorithm, based on performance profiles provided by Dolan and More.