Optimization of black-box problems using Smolyak grids and polynomial approximations
type: Item
instance of: scholarly article
title: Optimization of black-box problems using Smolyak grids and polynomial approximations
zbMATH Open document ID: 1405.90107
author: Chris A. Kieslich
author: Fani Boukouvala
author: Christodoulos A. Floudas
published in: Journal of Global Optimization
publication date: 2018-08-29T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6928829
zbMATH Keywords: surrogate-based optimization
zbMATH Keywords: black-box optimization
zbMATH Keywords: Smolyak grids
zbMATH Keywords: sparse grids
zbMATH Keywords: Chebyshev
zbMATH Keywords: polynomial interpolation
describes a project that uses: EGO
describes a project that uses: BOBYQA
describes a project that uses: MultiMin
describes a project that uses: AQUARS
describes a project that uses: PSwarm
describes a project that uses: ARGONAUT
MaRDI profile type: Publication
full work available at URL: s10898-018-0643-0
OpenAlex ID: W2800439897
cites work: Q4435425
cites work: Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
cites work: Efficient global optimization of expensive black-box functions
cites work: A Progressive Barrier for Derivative-Free Nonlinear Programming
cites work: Introduction to Derivative-Free Optimization
cites work: A derivative-free method for solving box-constrained underdetermined nonlinear systems of equations
cites work: Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization
cites work: Derivative-free optimization: a review of algorithms and comparison of software implementations
cites work: ARGONAUT: algorithms for global optimization of constrained grey-box computational problems
cites work: Simulation optimization: a review of algorithms and applications
cites work: A method for simulation based optimization using radial basis functions
cites work: An evolutionary method for complex-process optimization
cites work: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
cites work: `` Direct Search'' Solution of Numerical and Statistical Problems
cites work: A Simplex Method for Function Minimization
cites work: Scatter search for chemical and bio-process optimization
cites work: Global optimization
cites work: A taxonomy of global optimization methods based on response surfaces
cites work: Q4308910
cites work: A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions
cites work: Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption
cites work: A radial basis function method for global optimization
cites work: SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
cites work: A quasi-multistart framework for global optimization of expensive functions using response surface models
cites work: Smolyak's algorithm for integration and \(L_1\)-approximation of multivariate functions with bounded mixed derivatives of second order
cites work: Multivariate quadrature on adaptive sparse grids
cites work: Computational Science - ICCS 2004
cites work: Adaptive Sparse Grids and Extrapolation Techniques
cites work: B-spline quasi-interpolation on sparse grids
cites work: Spatially adaptive sparse grids for high-dimensional data-driven problems
cites work: Spline interpolation on sparse grids
cites work: Q4010713
cites work: Q5600030
cites work: Numerical integration using sparse grids
cites work: Sampling and cubature on sparse grids based on a B-spline quasi-interpolation
cites work: Selected Recent Applications of Sparse Grids
cites work: Smolyak's algorithm for weighted \(L_1\)-approximation of multivariate functions with bounded \(r\)th mixed derivatives over \(\mathbb R^d\)
cites work: On weak tractability of the Smolyak algorithm for approximation problems
cites work: Explicit cost bounds of algorithms for multivariate tensor product problems
cites work: Hierarchical Gradient-Based Optimization with B-Splines on Sparse Grids
cites work: Global optimization with spline constraints: a new branch-and-bound method based on B-splines
cites work: SpaGrOW -- a derivative-free optimization scheme for intermolecular force field parameters based on sparse grid methods
cites work: A new algorithm for high-dimensional uncertainty quantification based on dimension-adaptive sparse grid approximation and reduced basis methods
cites work: Design of computer experiments: space filling and beyond
cites work: A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
cites work: Q4839975
cites work: The Runge phenomenon and spatially variable shape parameters in RBF interpolation
cites work: Error bounds for approximation in Chebyshev points
cites work: High dimensional polynomial interpolation on sparse grids
cites work: Q3510853
cites work: Smolyak method for solving dynamic economic models: Lagrange interpolation, anisotropic grid and adaptive domain
DOI: 10.1007/S10898-018-0643-0
description: scientific article; zbMATH DE number 6928829