scientific article; zbMATH DE number 3612798

zbMath0394.90092MaRDI QIDQ4177355

No author found.

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Nonlinear ProgrammingClustering AlgorithmRandom Search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (16)

Improvement of pure random search in global optimization ⋮ Population set-based global optimization algorithms: some modifications and numerical studies ⋮ Fast hydrological model calibration based on the heterogeneous parallel computing accelerated shuffled complex evolution method ⋮ Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions ⋮ A modification to the new version of the Price's algorithm for continuous global optimization problems ⋮ Modified controlled random search algorithms ⋮ Stochastic global optimization methods part II: Multi level methods ⋮ Concurrent stochastic methods for global optimization ⋮ A filled function method for finding a global minimizer of a function of several variables ⋮ Global optimization and simulated annealing ⋮ Global optimization for possibly time-dependent cost functions by a population set-based algorithm with births control ⋮ A stochastic method for global optimization ⋮ A tabu search Hooke and Jeeves algorithm for unconstrained optimization ⋮ Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization ⋮ Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization ⋮ Parallel algorithms for global optimization

This page was built for publication: