Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
From MaRDI portal
Publication:746814
DOI10.1007/s10898-015-0283-6zbMath1332.90213OpenAlexW2083225972MaRDI QIDQ746814
Ying Ma, Xiao-Fang Wang, Sheng-li Xu, Hai-Tao Liu
Publication date: 20 October 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0283-6
Related Items (5)
Kriging surrogate model with coordinate transformation based on likelihood and gradient ⋮ Local optimization of black-box functions with high or infinite-dimensional inputs: application to nuclear safety ⋮ Adaptive confidence bound based Bayesian optimization via potentially optimal Lipschitz conditions ⋮ On convergence rate of a rectangular partition based global optimization algorithm ⋮ SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems
Uses Software
Cites Work
- Unnamed Item
- A modified DIRECT algorithm with bilevel partition
- Constrained global optimization of expensive black box functions using radial basis functions
- A deterministic global optimization using smooth diagonal auxiliary functions
- An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization
- A univariate global search working with a set of Lipschitz constants for the first derivative
- An algorithm for global optimization of Lipschitz continuous functions
- Efficient global optimization of expensive black-box functions
- Global one-dimensional optimization using smooth auxiliary functions
- Global optimization by multilevel coordinate search
- Lipschitzian optimization without the Lipschitz constant
- Local tuning and partition strategies for diagonal GO methods
- Index information algorithm with local tuning for solving multidimensional global optimization problems with multiextremal constraints
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Estimation of the Lipschitz constant of a function
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A fully‐distributed parallel global search algorithm
- Introduction to Global Optimization Exploiting Space-Filling Curves
- An algorithm for fast optimal Latin hypercube design of experiments
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Estimation of the Minimum of a Function Using Order Statistics
- An algorithm for finding the absolute extremum of a function
- An Information Global Optimization Algorithm with Local Tuning
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- Algorithm 829
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A Sequential Method Seeking the Global Maximum of a Function
- Spatial prediction and ordinary kriging
- A radial basis function method for global optimization
- A locally-biased form of the DIRECT algorithm.
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
This page was built for publication: Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
