Constrained multifidelity optimization using model calibration

DOI10.1007/s00158-011-0749-1zbMath1274.74286OpenAlexW1978600984MaRDI QIDQ381821

Karen Willcox, Andrew March

Publication date: 15 November 2013

Published in: Structural and Multidisciplinary Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00158-011-0749-1

zbMATH Keywords

optimizationderivative-freeaerodynamic designmultidisciplinarymultifidelity

Mathematics Subject Classification ID

Optimization of other properties in solid mechanics (74P10)

Related Items

An algorithmic framework for the optimization of computationally expensive bi-fidelity black-box problems ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization ⋮ Multifidelity Robust Controller Design with Gradient Sampling ⋮ Bi-fidelity stochastic gradient descent for structural optimization under uncertainty ⋮ Machine learning materials physics: surrogate optimization and multi-fidelity algorithms predict precipitate morphology in an alternative to phase field dynamics ⋮ Expedited constrained multi-objective aerodynamic shape optimization by means of physics-based surrogates

Uses Software

• EGO
• Optimization Toolbox
• ORBIT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient global optimization of expensive black-box functions
• Lipschitzian optimization without the Lipschitz constant
• A taxonomy of global optimization methods based on response surfaces
• Geometry of interpolation sets in derivative free optimization
• Introduction to Derivative-Free Optimization
• ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
• A Stability Analysis for Perturbed Nonlinear Iterative Methods
• Trust Region Methods
• A Pattern Search Filter Method for Nonlinear Programming without Derivatives
• Predicting the output from a complex computer code when fast approximations are available
• A Derivative-Free Algorithm for Inequality Constrained Nonlinear Programming via Smoothing of an $\ell_\infty$ Penalty Function
• Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
• A Simplex Method for Function Minimization