Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
From MaRDI portal
Publication:1657403
DOI10.1007/s10479-017-2721-yzbMath1392.90110OpenAlexW2772084832WikidataQ59611144 ScholiaQ59611144MaRDI QIDQ1657403
Michael Patriksson, Ann-Brith Strömberg, Zuzana Nedělková, Peter Lindroth
Publication date: 13 August 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2721-y
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A literature survey of benchmark functions for global optimisation problems
- A method for simulation based optimization using radial basis functions
- Global optimization and stochastic differential equations
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Truncated Newton method for sparse unconstrained optimization using automatic differentiation
- Global optimization by controlled random search
- Efficient global optimization of expensive black-box functions
- An SQP method for general nonlinear programs using only equality constrained subproblems
- Lipschitzian optimization without the Lipschitz constant
- Direct search methods: Then and now
- A taxonomy of global optimization methods based on response surfaces
- Global optimization of costly nonconvex functions using radial basis functions
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- Engineering design applications of surrogate-assisted optimization techniques
- An overview of bilevel optimization
- A novel population initialization method for accelerating evolutionary algorithms
- Convex and concave relaxations of implicit functions
- Introduction to Derivative-Free Optimization
- ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
- Testing Unconstrained Optimization Software
- A controlled random search procedure for global optimisation
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Radial Basis Functions
- Benchmarking Derivative-Free Optimization Algorithms
- CUTEr and SifDec
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Scattered Data Approximation
- Global Optimization and Constraint Satisfaction
- Global optimization
- A radial basis function method for global optimization
- Benchmarking optimization software with performance profiles.
- Metamodels for computer-based engineering design: Survey and recommendations
This page was built for publication: Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
