{'fraction_non_alphanumeric': 0.015492957746478873, 'fraction_numerical': 0.0, 'mean_word_length': 5.583333333333333, '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}}
Hadamard Directional Differentiability of the Optimal Value Function of a Quadratic Programming Problem

In this paper, we consider the stability analysis of a convex quadratic programming (QP) problem and its restricted Wolfe dual when all parameters in the problem are perturbed. Based on the continuity of the feasible set mapping, we establish the upper semi-continuity of the optimal solution mappings of the convex QP problem and the restricted Wolfe dual problem. Furthermore, by characterizing the optimal value function as a min–max optimization problem over two compact convex sets, we demonstrate the Lipschitz continuity and the Hadamard directional differentiability of the optimal value function.