SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems
DOI10.1007/S10898-016-0407-7zbMATH Open1356.90136OpenAlexW2266445208WikidataQ59477362 ScholiaQ59477362MaRDI QIDQ727388FDOQ727388
Authors: Tipaluck Krityakierne, Taimoor Akhtar, Christine A. Shoemaker
Publication date: 6 December 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0407-7
Recommendations
- GOPS: efficient RBF surrogate global optimization algorithm with high dimensions and many parallel processors including application to multimodal water quality PDE model calibration
- Multi objective optimization of computationally expensive multi-modal functions with RBF surrogates and multi-rule selection
- Efficient global optimization algorithm assisted by multiple surrogate techniques
- SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
- A parallel Bayesian optimization method based on adaptive surrogate model
blackboxresponse surfaceradial basis functionsmetamodelsimulation optimizationcomputationally expensivetabu
Cites Work
- Efficient global optimization of expensive black-box functions
- Introduction to Stochastic Search and Optimization
- Multi-objective optimization using evolutionary algorithms
- A radial basis function method for global optimization
- Global optimization of stochastic black-box systems via sequential kriging meta-models
- Algorithmic construction of optimal symmetric Latin hypercube designs.
- Efficient global optimization algorithm assisted by multiple surrogate techniques
- A stochastic radial basis function method for the global optimization of expensive functions
- Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for~computationally expensive black-box global optimization problems
- Globally-biased disimpl algorithm for expensive global optimization
- Title not available (Why is that?)
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
- Parallel stochastic global optimization using radial basis functions
- On the design of optimization strategies based on global response surface approximation models
- Asynchronous parallel pattern search for nonlinear optimization
- Multi objective optimization of computationally expensive multi-modal functions with RBF surrogates and multi-rule selection
Cited In (13)
- Dynamic exploration-exploitation Pareto approach for high-dimensional expensive black-box optimization
- A surrogate-based cooperative optimization framework for computationally expensive black-box problems
- A parallel Bayesian optimization method based on adaptive surrogate model
- SOMS: SurrOgate MultiStart algorithm for use with nonlinear programming for global optimization
- On the choice of the low-dimensional domain for global optimization via random embeddings
- SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications
- High-dimensional black-box optimization under uncertainty
- An efficient class of direct search surrogate methods for solving expensive optimization problems with CPU-time-related functions
- SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
- GOPS: efficient RBF surrogate global optimization algorithm with high dimensions and many parallel processors including application to multimodal water quality PDE model calibration
- Notes on the convergence and applications of surrogate optimization
- Integrating \(\varepsilon \)-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems
- Efficient global optimization algorithm assisted by multiple surrogate techniques
Uses Software
This page was built for publication: SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727388)