A simplex-based numerical framework for simple and efficient robust design optimization
From MaRDI portal
Publication:360385
DOI10.1007/s10589-013-9569-0zbMath1276.90042OpenAlexW2092901877MaRDI QIDQ360385
Gianluca Iaccarino, Jeroen A. S. Witteveen, Pietro Marco Congedo
Publication date: 26 August 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9569-0
robust optimizationuncertainty quantificationNelder-Mead methodsimplex stochastic collocation method
Related Items
Simplex-stochastic collocation method with improved scalability ⋮ A hybrid anchored-ANOVA - POD/Kriging method for uncertainty quantification in unsteady high-fidelity CFD simulations ⋮ An adaptive strategy on the error of the objective functions for uncertainty-based derivative-free optimization
Uses Software
Cites Work
- Unnamed Item
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- On the effects of non-linear elements in the reliability-based optimal design of stochastic dynamical systems
- Engineering optimisation by cuckoo search
- Shape optimization of an airfoil in a BZT flow with multiple-source uncertainties
- A convergent variant of the Nelder--Mead algorithm
- Robust design of structures using optimization methods
- Multi-element probabilistic collocation method in high dimensions
- Grid restrained Nelder-Mead algorithm
- An adaptive high-dimensional stochastic model representation technique for the solution of stochastic partial differential equations
- A method for stochastic constrained optimization using derivative-free surrogate pattern search and collocation
- Robust optimization - a comprehensive survey
- A novel sampling approach to combinatorial optimization under uncertainty
- Computational methods in optimization considering uncertainties - An overview
- Simplex Stochastic Collocation with Random Sampling and Extrapolation for Nonhypercube Probability Spaces
- Refinement Criteria for Simplex Stochastic Collocation with Local Extremum Diminishing Robustness
- Efficient Implementation of the Nelder-Mead Search Algorithm
- Effect of dimensionality on the Nelder–Mead simplex method
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- Analysis of Generalized Pattern Searches
- Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
- A Simplex Method for Function Minimization
