A new partition method for DIRECT-type algorithm based on minimax design
From MaRDI portal
Publication:6183090
DOI10.1007/s10898-023-01297-6OpenAlexW4378084838MaRDI QIDQ6183090
Taihe Yi, Kai Jia, Liang Yan, Zhengming Wang, Xiao-Jun Duan, Xuan Chen
Publication date: 26 January 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-023-01297-6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Improving the convergence rate of the DIRECT global optimization algorithm
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- Lipschitzian optimization without the Lipschitz constant
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- An application of nonlinear optimization in molecular biology
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- The DIRECT algorithm: 25 years later
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
- Covering of high-dimensional cubes and quantization
- Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences
- Simplicial Lipschitz optimization without the Lipschitz constant
- Globally-biased disimpl algorithm for expensive global optimization
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- Interpolation of Lipschitz functions
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Derivative-Free Optimization
- Coordination and Geometric Optimization via Distributed Dynamical Systems
- Introduction to Derivative-Free Optimization
- Nonsmooth Coordination and Geometric Optimization via Distributed Dynamical Systems
- Coffee-House Designs
- Algorithm 829
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A locally-biased form of the DIRECT algorithm.
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
This page was built for publication: A new partition method for DIRECT-type algorithm based on minimax design
