A new partition method for DIRECT-type algorithm based on minimax design
From MaRDI portal
Publication:6183090
Recommendations
- scientific article; zbMATH DE number 5375044
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Optimization algorithm based on densification and dynamic canonical descent
- Optimized U-type designs on flexible regions
- Finding local optima of high-dimensional functions using direct search methods
Cites work
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- A locally-biased form of the DIRECT algorithm.
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
- Algorithm 829
- An application of nonlinear optimization in molecular biology
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Coffee-house designs
- Coordination and Geometric Optimization via Distributed Dynamical Systems
- Covering of high-dimensional cubes and quantization
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- Derivative-Free Optimization
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Globally-biased disimpl algorithm for expensive global optimization
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Improving the convergence rate of the DIRECT global optimization algorithm
- Incremental space-filling design based on coverings and spacings: improving upon low discrepancy sequences
- Interpolation of Lipschitz functions
- Introduction to Derivative-Free Optimization
- Introduction to global optimization exploiting space-filling curves
- Lipschitzian optimization without the Lipschitz constant
- Minimax and maximin space-filling designs: some properties and methods for construction
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- Nonsmooth Coordination and Geometric Optimization via Distributed Dynamical Systems
- On the Pareto optimality in the context of Lipschitzian optimization
- Optimization by simulated annealing
- Simplicial Lipschitz optimization without the Lipschitz constant
- The DIRECT algorithm: 25 years later
This page was built for publication: A new partition method for DIRECT-type algorithm based on minimax design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183090)
