{'fraction_non_alphanumeric': 0.012269938650306749, 'fraction_numerical': 0.0, 'mean_word_length': 4.956204379562044, '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}}
Minimization with the affine normal direction

In this paper, we consider minimization of a real-valued function f over R and study the choice of the affine normal of the level set hypersurfaces of f as a direction for minimization. The affine normal vector arises in affine differential geometry when answering the question of what hypersurfaces are invariant under unimodular affine transformations. It can be computed at points of a hypersurface from local geometry or, in an alternate description, centers of gravity of slices. In the case where f is quadratic, the line passing through any chosen point parallel to its affine normal will pass through the critical point of f . We study numerical techniques for calculating affine normal directions of level set surfaces of convex f for minimization algorithms.