Algorithm 829
From MaRDI portal
Publication:5461074
DOI10.1145/962437.962444zbMath1068.90600OpenAlexW2025280025WikidataQ113309736 ScholiaQ113309736MaRDI QIDQ5461074
Daniela Lera, Marco Gaviano, Yaroslav D. Sergeyev, Dmitri E. Kvasov
Publication date: 21 July 2005
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/962437.962444
Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (75)
A batch, derivative-free algorithm for finding multiple local minima ⋮ Asynchronously parallel optimization solver for finding multiple minima ⋮ Adaptive global optimization based on a block-recursive dimensionality reduction scheme ⋮ Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions ⋮ Modifications of real code genetic algorithm for global optimization ⋮ Best practices for comparing optimization algorithms ⋮ Parallel global optimization on GPU ⋮ Adaptive nested optimization scheme for multidimensional global search ⋮ Test problem generator for unconstrained global optimization ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ Generalized parallel computational schemes for time-consuming global optimization ⋮ On the utility of randomly generated functions for performance evaluation of evolutionary algorithms ⋮ Geodesic and contour optimization using conformal mapping ⋮ Modified DIRECT Algorithm for Scaled Global Optimization Problems ⋮ Lipschitz global optimization methods in control problems ⋮ PDoublePop: an implementation of parallel genetic algorithm for function optimization ⋮ Study of multiscale global optimization based on parameter space partition ⋮ Branch-and-Model: a derivative-free global optimization algorithm ⋮ Metaheuristic vs. deterministic global optimization algorithms: the univariate case ⋮ Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes ⋮ Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems ⋮ Revisiting `survival of the fittest' principle in global stochastic optimisation: incorporating anisotropic mutations ⋮ An accelerated algorithm for finding efficient solutions in multiobjective problems with black-box multiextremal criteria ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ A new partition method for DIRECT-type algorithm based on minimax design ⋮ Parameter Selection in Gaussian Process Interpolation: An Empirical Study of Selection Criteria ⋮ 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 ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ Benchmarking nonlinear optimization software in technical computing environments ⋮ Lipschitz gradients for global optimization in a one-point-based partitioning scheme ⋮ A hybrid of Bayesian approach based global search with clustering aided local refinement ⋮ Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme ⋮ Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant ⋮ Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems ⋮ An information global minimization algorithm using the local improvement technique ⋮ A local search method for continuous global optimization ⋮ Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms ⋮ Computationally efficient approach for solving lexicographic multicriteria optimization problems ⋮ A new class of test functions for global optimization ⋮ A filling function method for unconstrained global optimization ⋮ A global minimization algorithm for Lipschitz functions ⋮ Learning Enabled Constrained Black-Box Optimization ⋮ Constructing test functions for global optimization using continuous formulations of graph problems ⋮ Improving the convergence rate of the DIRECT global optimization algorithm ⋮ Globally-biased disimpl algorithm for expensive global optimization ⋮ 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 ⋮ GOSH: derivative-free global optimization using multi-dimensional space-filling curves ⋮ Bayesian optimization of pump operations in water distribution systems ⋮ Stopping rules for box-constrained stochastic global optimization ⋮ A statistical model-based algorithm for ‘black-box’ multi-objective optimisation ⋮ Lipschitz and Hölder global optimization using space-filling curves ⋮ Genanneal: genetically modified simulated annealing ⋮ Genetically controlled random search: a global optimization method for continuous multidimensional functions ⋮ MinFinder: locating all the local minima of a function ⋮ Genmin: an enhanced genetic algorithm for global optimization ⋮ Properties and numerical testing of a parallel global optimization algorithm ⋮ Enhancing PSO methods for global optimization ⋮ A \textsc{direct}-type global optimization algorithm for image registration ⋮ The DIRECT algorithm: 25 years later ⋮ Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants ⋮ A modified quasisecant method for global optimization ⋮ Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems ⋮ Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces ⋮ Algorithm 829 ⋮ A univariate global search working with a set of Lipschitz constants for the first derivative ⋮ Multidimensional Lipschitz global optimization based on efficient diagonal partitions ⋮ COCO: a platform for comparing continuous optimizers in a black-box setting ⋮ Multidimensional global optimization using numerical estimates of objective function derivatives ⋮ MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems ⋮ Exploration of anisotropic design space by using unified Taylor-cokriging method ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients ⋮ An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
Uses Software
This page was built for publication: Algorithm 829
