{'fraction_non_alphanumeric': 0.020809248554913295, 'fraction_numerical': 0.0, 'mean_word_length': 5.713178294573644, '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}}
Improved Feasible SQP Algorithm for Nonlinear Programs with Equality Constrained Sub-Problems

This paper is concerned with an improved feasible sequential quadratic programming (FSQP) method for nonlinear programs. As compared with the existing SQP methods which required solving the QP sub-problem with inequality constraints in single iteration, in order to obtain the feasible direction, the method of this paper is only necessary to solve an equality constrained quadratic programming sub-problems. Combined the generalized projection technique, a height-order correction direction is yielded by explicit formulas, which can avoids Maratos effect. Furthermore, under some mild assumptions, the algorithm is globally convergent and its rate of convergence is one-step superlinearly. Numerical results reported show that the algorithm in this paper is effective.