{'fraction_non_alphanumeric': 0.015267175572519083, 'fraction_numerical': 0.0, 'mean_word_length': 4.472222222222222, '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 duality-type method for the design of beams

We discuss the nonconvex optimal shape design problem of minimizing the weight of a loaded beam subject to de ection constraints. We associate to it a convex minimization problem which will play the role of a dual. The algorithm we propose has a global character and iterates between the two optimization problems via a so called \resizing rule".