2021
DOI: 10.2514/1.j059826
|View full text |Cite
|
Sign up to set email alerts
|

Evaluating the Risk of Local Optima in Aerodynamic Shape Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 33 publications
0
4
0
Order By: Relevance
“…In this study, the sequential quadratic programming (SQP) optimization algorithm is employed as the gradient-based optimizer. The SQP algorithm, chosen for its high efficiency and ability to handle large-scale design variables and function constraints [54,55], is a prominent gradient optimizer widely employed in current practices and has found extensive application in various engineering problems [56][57][58]. The fundamental concept revolves around transforming constrained nonlinear optimization problems into subproblems of quadratic programming at each iteration.…”
Section: Gradient-based Optimization Algorithmmentioning
confidence: 99%
“…In this study, the sequential quadratic programming (SQP) optimization algorithm is employed as the gradient-based optimizer. The SQP algorithm, chosen for its high efficiency and ability to handle large-scale design variables and function constraints [54,55], is a prominent gradient optimizer widely employed in current practices and has found extensive application in various engineering problems [56][57][58]. The fundamental concept revolves around transforming constrained nonlinear optimization problems into subproblems of quadratic programming at each iteration.…”
Section: Gradient-based Optimization Algorithmmentioning
confidence: 99%
“…These articles have focused on MLPs as their DL framework and have specifically employed a gradient-enhanced version of such networks. While such methods have shown good accuracy, they have been explicitly developed for gradient-based optimization algorithms, which may not be adequate in many cases [8,48]. Another set of data-driven ROMs employed recently was based on proper orthogonal decomposition (POD) bases [55] and hyper-reduction based on POD modes [30].…”
Section: Uniqueness Of the Proposed Reduced-order Modeling Approachmentioning
confidence: 99%
“…[12,27,17]. These studies have completely relied on a gradient-based search algorithm, which can very frequently converge to local optima for a non-convex, multi-objective shape optimization problem, especially when there are many design parameters [8,48]. However, employing expensive metaheuristic algorithms that can convergence to the global optima remain largely non-tractable with high-fidelity solvers.…”
Section: Introductionmentioning
confidence: 99%
“…The overall goal of this work is to make high-fidelity global multi-disciplinary optimization of wings a reality, and the use of a compact aerofoil decomposition for the design variables is a pillar to this goal. Whilst fixed planform optimization of rigid aerodynamic wings is generally considered to be unimodal (Yu et al 2018), introducing planform changes along with sectional changes introduces clear multimodality (Poole et al 2018b;Streuber and Zingg 2021). Furthermore, similar behaviour is also likely to be seen in aeroelastic wing optimization so there is a clear need to consider how global methods could be introduced into high-fidelity wing optimization.…”
Section: Introductionmentioning
confidence: 99%