Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
type: Item
instance of: scholarly article
title: Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
zbMATH Open document ID: 1392.90110
author: Zuzana Nedělková
author: Peter Lindroth
author: Michael Patriksson
author: Ann-Brith Strömberg
published in: Annals of Operations Research
publication date: 2018-08-13T00:00:00Z
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 6916968
zbMATH Keywords: simulation-based optimization
zbMATH Keywords: surrogate model
zbMATH Keywords: response surface
zbMATH Keywords: partition of variables
zbMATH Keywords: tyres
Wikidata QID: Q59611144
describes a project that uses: Matlab
describes a project that uses: CUTEr
describes a project that uses: TOMLAB
describes a project that uses: DACE
describes a project that uses: minpack
describes a project that uses: EGO
describes a project that uses: SifDec
describes a project that uses: NOMAD
describes a project that uses: ORBIT
MaRDI profile type: Publication
full work available at URL: s10479-017-2721-y
OpenAlex ID: W2772084832
cites work: Global optimization and stochastic differential equations
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: An SQP method for general nonlinear programs using only equality constrained subproblems
cites work: Global optimization of costly nonconvex functions using radial basis functions
cites work: Radial Basis Functions
cites work: An overview of bilevel optimization
cites work: Introduction to Derivative-Free Optimization
cites work: Truncated Newton method for sparse unconstrained optimization using automatic differentiation
cites work: Benchmarking optimization software with performance profiles.
cites work: Q3372265
cites work: CUTEr and SifDec
cites work: A radial basis function method for global optimization
cites work: A method for simulation based optimization using radial basis functions
cites work: A literature survey of benchmark functions for global optimisation problems
cites work: A branch-and-bound algorithm for bound constrained optimization problems without derivatives
cites work: A taxonomy of global optimization methods based on response surfaces
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: Efficient global optimization of expensive black-box functions
cites work: Direct search methods: Then and now
cites work: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Testing Unconstrained Optimization Software
cites work: Q4699403
cites work: A controlled random search procedure for global optimisation
cites work: Global optimization by controlled random search
cites work: A novel population initialization method for accelerating evolutionary algorithms
cites work: Q3897937
cites work: Global Optimization and Constraint Satisfaction
cites work: Metamodels for computer-based engineering design: Survey and recommendations
cites work: Engineering design applications of surrogate-assisted optimization techniques
cites work: Convex and concave relaxations of implicit functions
cites work: Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
cites work: Global optimization
cites work: Scattered Data Approximation
cites work: ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
cites work: Q4158412
DOI: 10.1007/S10479-017-2721-Y
DBLP publication ID: journals/anor/NedelkovaLPS18
description: scientific article; zbMATH DE number 6916968