{'fraction_non_alphanumeric': 0.011382113821138212, 'fraction_numerical': 0.0008130081300813008, 'mean_word_length': 5.618279569892473, '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 contribution to identification of convex structures for global optimization of permanent magnet machines

Application of modern mathematical optimization has become an important tool for the design of permanent magnet machines. This paper focuses on identification of particular mathematical structures, which can be obtained by appropriate formulation of otherwise well-known analytical equations. This problem formulation can be used for reliable and efficient optimization, notably in regards to the certification of the optimality. In other words, locally optimal solutions are avoided, and it can be guaranteed that a solution is globally optimal. The tool for the certification of optimality is the exploitation of convexity characteristics during the problem formulation, as convex optimization has proven to be a very efficient and highly reliable optimization method. To this aim, the problem formulation for maximization of several performance parameters of a brush less DC permanent magnet motor with use of soft magnetic composites and 3D flux distribution is discussed. The results can be considered as elements of a library of tools leading towards reliable and efficient optimization of permanent magnet machines.