swMATH4467MaRDI QIDQ16642FDOQ16642
Author name not available (Why is that?)
Official website: http://dl.acm.org/citation.cfm?id=962444
Cited In (88)
- Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
- Bayesian optimization of pump operations in water distribution systems
- A \textsc{direct}-type global optimization algorithm for image registration
- The DIRECT algorithm: 25 years later
- Multidimensional global optimization using numerical estimates of objective function derivatives
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems
- A modified quasisecant method for global optimization
- A hybrid of Bayesian approach based global search with clustering aided local refinement
- Globally-biased disimpl algorithm for expensive global optimization
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- A new class of test functions for global optimization
- Adaptive global optimization based on a block-recursive dimensionality reduction scheme
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Computationally efficient approach for solving lexicographic multicriteria optimization problems
- Benchmarking nonlinear optimization software in technical computing environments
- Geodesic and contour optimization using conformal mapping
- Genetically controlled random search: a global optimization method for continuous multidimensional functions
- Genmin: an enhanced genetic algorithm for global optimization
- Constructing test functions for global optimization using continuous formulations of graph problems
- Modifications of real code genetic algorithm for global optimization
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- On the utility of randomly generated functions for performance evaluation of evolutionary algorithms
- Lipschitz global optimization methods in control problems
- Best practices for comparing optimization algorithms
- A batch, derivative-free algorithm for finding multiple local minima
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- A global minimization algorithm for Lipschitz functions
- Metaheuristic vs. deterministic global optimization algorithms: the univariate case
- Enhancing PSO methods for global optimization
- Lipschitz and Hölder global optimization using space-filling curves
- A local search method for continuous global optimization
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- Global Optimization Toolbox For Maple
- LGO
- Properties and numerical testing of a parallel global optimization algorithm
- SFSDP
- simannf90
- SIGOA
- VTDIRECT95
- QSM
- MultiMin
- Generalized parallel computational schemes for time-consuming global optimization
- Stochastic global optimization and its applications with fuzzy adaptive simulated annealing
- GenMin
- MCS
- IOSO
- Global Optimization Test
- MrDIRECT
- Study of multiscale global optimization based on parameter space partition
- MinFinder
- Algorithm 709
- ecr
- Multidimensional Lipschitz global optimization based on efficient diagonal partitions
- Adaptive nested optimization scheme for multidimensional global search
- Parallel global optimization on GPU
- Function Parser
- SymDIRECT
- SMPSO
- Globalizer
- IOHprofiler
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- An information global minimization algorithm using the local improvement technique
- DIRDFN
- DIRMIN
- DDFSA
- DFSA
- TESTGO
- BBOB
- Emmental-type GKLS
- GCGen
- jMetalPy
- COCO: a platform for comparing continuous optimizers in a black-box setting
- MinFinder: locating all the local minima of a function
- Efficient multicriterial optimization based on intensive reuse of search information
- A filling function method for unconstrained global optimization
- A deterministic global optimization using smooth diagonal auxiliary functions
- Stopping rules for box-constrained stochastic global optimization
- Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions
- Asynchronously parallel optimization solver for finding multiple minima
- Solving a set of global optimization problems by the parallel technique with uniform convergence
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
- Improving the convergence rate of the DIRECT global optimization algorithm
This page was built for software: Algorithm 829
