Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
From MaRDI portal
Abstract: In the paper, the global optimization problem of a multidimensional "black-box" function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz constant is considered. A new efficient algorithm for solving this problem is presented. At each iteration of the method a number of possible Lipschitz constants is chosen from a set of values varying from zero to infinity. This idea is unified with an efficient diagonal partition strategy. A novel technique balancing usage of local and global information during partitioning is proposed. A new procedure for finding lower bounds of the objective function over hyperintervals is also considered. It is demonstrated by extensive numerical experiments performed on more than 1600 multidimensional test functions that the new algorithm shows a very promising performance.
Recommendations
Cited in
(86)- A univariate global search working with a set of Lipschitz constants for the first derivative
- Multidimensional Lipschitz global optimization based on efficient diagonal partitions
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
- A global optimization algorithm for multivariate functions with Lipschitzian first derivatives
- Local tuning and partition strategies for diagonal GO methods
- Best practices for comparing optimization algorithms
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
- Geodesic and contour optimization using conformal mapping
- Inferring large graphs using \(\ell_1\)-penalized likelihood
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems
- A direct search algorithm for global optimization
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Solving a set of global optimization problems by the parallel technique with uniform convergence
- Efficient multicriterial optimization based on intensive reuse of search information
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
- Approximating a solution set of nonlinear inequalities
- On convergence rate of a rectangular partition based global optimization algorithm
- Bayesian optimization of pump operations in water distribution systems
- A multi-objective \textbf{DIRECT} algorithm for ship hull optimization
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- A partition-based global optimization algorithm
- Stochastic global optimization using tangent minorants for Lipschitz functions
- On the extension of the \textsc{direct} algorithm to multiple objectives
- A \textsc{direct}-type global optimization algorithm for image registration
- The DIRECT algorithm: 25 years later
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
- 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 -Lipschitz framework
- Comparison of several stochastic and deterministic derivative-free global optimization algorithms
- A hybrid of Bayesian approach based global search with clustering aided local refinement
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- A hybrid global optimization algorithm for nonlinear least squares regression
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- Combining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedback
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case
- Optimization challenges in the structured low rank approximation problem
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- On the experimental investigation of Pareto-Lipschitzian optimization
- A new expected-improvement algorithm for continuous minimax optimization
- Parallel global optimization on GPU
- Global search perspectives for multiobjective optimization
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- Lipschitz global optimization methods in control problems
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- scientific article; zbMATH DE number 1795727 (Why is no real title available?)
- ANOVA-MOP: ANOVA decomposition for multiobjective optimization
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- On the Pareto optimality in the context of Lipschitzian optimization
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- A hybrid of Bayesian-based global search with Hooke-Jeeves local refinement for multi-objective optimization problems
- Stability Analysis of DESA Optimization Algorithm
- Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization
- Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
- Improving the convergence rate of the DIRECT global optimization algorithm
- MSO: a framework for bound-constrained black-box global optimization algorithms
- On deterministic diagonal methods for solving global optimization problems with Lipschitz gradients
- scientific article; zbMATH DE number 2205701 (Why is no real title available?)
- Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms
- Acceleration tools for diagonal information global optimization
- Multidimensional global optimization using the first derivatives
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- Granular sieving algorithm for selecting best n n parameters
- Branch-and-Model: a derivative-free global optimization algorithm
- Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization
- A new partition method for DIRECT-type algorithm based on minimax design
- Numerical methods using two different approximations of space-filling curves for black-box global optimization
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
- P-algorithm based on a simplicial statistical model of multimodal functions
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption
- Filter-based DIRECT method for constrained global optimization
- Data-driven Lipschitz-informed convex underestimators for branch-and-bound optimization of black-box functions
- An efficient global optimization algorithm with adaptive estimates of the local Lipschitz constants
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- A practical DIRECT-type algorithm for medium-scale black-box global optimization
- An open-source parallel algorithm of Bayesian-based global search with Hooke-Jeeves local refinement for multi-objective optimization problems
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
- Diagonal generalizaton of the DIRECT method for problems with constraints
- A deterministic global optimization using smooth diagonal auxiliary functions
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
- Lipschitz and Hölder global optimization using space-filling curves
This page was built for publication: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470225)
