Numerical methods using two different approximations of space-filling curves for black-box global optimization
From MaRDI portal
Publication:6200380
DOI10.1007/s10898-022-01216-1MaRDI QIDQ6200380
Daniela Lera, Yaroslav D. Sergeyev, Maria Chiara Nasso
Publication date: 22 March 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
deterministic global optimizationblack-box functionsspace-filling curvesLipschitz and Hölder conditions
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Lipschitz global optimization methods in control problems
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- Lipschitz and Hölder global optimization using space-filling curves
- Constrained global optimization: algorithms and applications
- Global multidimensional optimization on parallel computer
- A global optimization technique for checking parametric robustness
- Lipschitzian optimization without the Lipschitz constant
- A parallel method for finding the global minimum of univariate functions
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global minimization algorithms for Hölder functions
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Global optimization of Hölder functions
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- Stochastic global optimization.
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Simplicial Global Optimization
- Derivative-Free and Blackbox Optimization
- Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
- On convergence of "divide the best" global optimization algorithms
- Deterministic Global Optimization
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme
- Bayesian and High-Dimensional Global Optimization
- Bayesian Optimization and Data Science
- Algorithm 829
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
This page was built for publication: Numerical methods using two different approximations of space-filling curves for black-box global optimization