{'fraction_non_alphanumeric': 0.011668611435239206, 'fraction_numerical': 0.005834305717619603, 'mean_word_length': 5.755905511811024, '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}}
Variable Complexity Optimization

Variable Complexity Optimization Praveen Thokala Master of Applied Science Graduate Department of Aerospace Science and Engineering University of Toronto 2005 This thesis deals with variable-complexity optimization, which consists of either using high and low fidelity models of the analysis or using variable parameterization of the optimization problem to reduce the computational cost of the optimization process. In this thesis, we present a variable-fidelity framework based on the approach proposed by Alexandrov that is mathematically robust. We then present the results on analytical test cases for the framework and a variable parameterization method, which involves using different design variables during the course of the optimization process. We then present our results for a 2-D airfoil optimization problem.