{'fraction_non_alphanumeric': 0.016853932584269662, 'fraction_numerical': 0.0, 'mean_word_length': 4.892561983471074, '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}}
An old problem and new tools

The aim of the paper is to demonstrate the efficiency of application of the Theory of Exact Penalties and Nonsmooth Optimization to solving variational problems. As an example we discuss the main (or so-called simplest) problem of the Calculus of Variations. It is shown that this approach allows one not only to get the main known results (e.g., the Euler and Weierstrass necessary conditions) but also to gain a deeper understanding of the intristic nature of the Euler condition, to derive new extremality conditions and to construct new direct numerical methods for solving variational problems based on the notions of subgradient and hypogradient of the exact penalty function.