Local tuning and partition strategies for diagonal GO methods
From MaRDI portal
Publication:1402152
Abstract: In this paper, global optimization (GO) Lipschitz problems are considered where the multi-dimensional multiextremal objective function is determined over a hyperinterval. An efficient one-dimensional GO method using local tuning on the behavior of the objective function is generalized to the multi-dimensional case by the diagonal approach using two partition strategies. Global convergence conditions are established for the obtained diagonal geometric methods. Results of a wide numerical comparison show a strong acceleration reached by the new methods working with estimates of the local Lipschitz constants over different subregions of the search domain in comparison with the traditional approach.
Recommendations
- A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
- Parallel information algorithm with local tuning for solving multidimensional GO problems
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Publication:4870332
- Parallel local search
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Balancing global and local search in parallel efficient global optimization algorithms
- Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
- scientific article; zbMATH DE number 1256747
Cited in
(29)- Acceleration tools for diagonal information global optimization
- scientific article; zbMATH DE number 1795727 (Why is no real title available?)
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- A one-dimensional local tuning algorithm for solving GO problems with partially defined constraints
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- Globally-biased disimpl algorithm for expensive global optimization
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems
- On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods
- Multidimensional Lipschitz global optimization based on efficient diagonal partitions
- A hybrid of Bayesian approach based global search with clustering aided local refinement
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- The DIRECT algorithm: 25 years later
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
- A deterministic global optimization using smooth diagonal auxiliary functions
- MSO: a framework for bound-constrained black-box global optimization algorithms
- On deterministic diagonal methods for solving global optimization problems with Lipschitz gradients
- Adaptive nested optimization scheme for multidimensional global search
- Parallel information algorithm with local tuning for solving multidimensional GO problems
- Solving a set of global optimization problems by the parallel technique with uniform convergence
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Efficient multicriterial optimization based on intensive reuse of search information
This page was built for publication: Local tuning and partition strategies for diagonal GO methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402152)
