The following pages link to Algorithm 829 (Q5461074):
Displaying 23 items.
- A batch, derivative-free algorithm for finding multiple local minima (Q2357976) (← links)
- Modifications of real code genetic algorithm for global optimization (Q2378969) (← links)
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case (Q2422871) (← links)
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes (Q2422874) (← links)
- A new class of test functions for global optimization (Q2460145) (← links)
- A global minimization algorithm for Lipschitz functions (Q2465562) (← links)
- Stopping rules for box-constrained stochastic global optimization (Q2479233) (← links)
- Modified DIRECT Algorithm for Scaled Global Optimization Problems (Q2942499) (← links)
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme (Q5122280) (← links)
- Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant (Q5122335) (← links)
- Learning Enabled Constrained Black-Box Optimization (Q5153491) (← links)
- A statistical model-based algorithm for ‘black-box’ multi-objective optimisation (Q5172540) (← links)
- On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients (Q5270520) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- COCO: a platform for comparing continuous optimizers in a black-box setting (Q5859012) (← links)
- Multidimensional global optimization using numerical estimates of objective function derivatives (Q5865327) (← links)
- Branch-and-Model: a derivative-free global optimization algorithm (Q6097758) (← links)
- Revisiting `survival of the fittest' principle in global stochastic optimisation: incorporating anisotropic mutations (Q6143064) (← links)
- Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization (Q6183089) (← links)
- A new partition method for DIRECT-type algorithm based on minimax design (Q6183090) (← links)
- Parameter Selection in Gaussian Process Interpolation: An Empirical Study of Selection Criteria (Q6188695) (← links)
- Numerical methods using two different approximations of space-filling curves for black-box global optimization (Q6200380) (← links)
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework (Q6200381) (← links)
