Numerical methods using two different approximations of space-filling curves for black-box global optimization
From MaRDI portal
(Redirected from Publication:6200380)
Recommendations
- Lipschitz and Hölder global optimization using space-filling curves
- Introduction to global optimization exploiting space-filling curves
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Global optimization with space-filling curves.
Cites work
- scientific article; zbMATH DE number 3691091 (Why is no real title available?)
- scientific article; zbMATH DE number 2205701 (Why is no real title available?)
- A global optimization technique for checking parametric robustness
- A parallel method for finding the global minimum of univariate functions
- Algorithm 829
- Bayesian and High-Dimensional Global Optimization
- Bayesian optimization and data science
- Constrained global optimization: algorithms and applications
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- Derivative-free and blackbox optimization
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Deterministic global optimization. An introduction to the diagonal approach
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Global minimization algorithms for Hölder functions
- Global multidimensional optimization on parallel computer
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Global optimization of Hölder functions
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Introduction to global optimization exploiting space-filling curves
- Lipschitz and Hölder global optimization using space-filling curves
- Lipschitz global optimization methods in control problems
- Lipschitzian optimization without the Lipschitz constant
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
- On convergence of "divide the best" global optimization algorithms
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- Safe global optimization of expensive noisy black-box functions in the -Lipschitz framework
- Simplicial global optimization
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
- Stochastic global optimization.
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
Cited in
(4)
This page was built for publication: Numerical methods using two different approximations of space-filling curves for black-box global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200380)
