scientific article; zbMATH DE number 3598385
From MaRDI portal
Publication:4165315
zbMath0385.00011MaRDI QIDQ4165315
No author found.
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to systems and control theory (93-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items
Improvement of pure random search in global optimization, Improving hit-and-run for global optimization, Simulated annealing for constrained global optimization, État de l'art des méthodes “d'optimisation globale”, Simulated annealing, random search, MultiStart or SAD?, An informational approach to the global optimization of expensive-to-evaluate functions, Topographical multilevel single linkage, Best practices for comparing optimization algorithms, Two algorithms for global optimization, A novel filled function method and quasi-filled function method for global optimization, A branch-and-bound algorithm for bound constrained optimization problems without derivatives, A quasi-multistart framework for global optimization of expensive functions using response surface models, An algorithm for solving global optimization problems with nonlinear constraints, Stochastic global optimization methods part I: Clustering methods, Stochastic global optimization methods part II: Multi level methods, Sequential stopping rules for the multistart algorithm in global optimisation, Benchmarking nonlinear optimization software in technical computing environments, Multicriterion optimization using interval analysis, Comparing three error criteria for selecting radial basis function network topology, Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives, A hybrid algorithm for identifying global and local minima when optimizing functions with many minima., Global optimization and simulated annealing, Bayesian methods in global optimization, Pure adaptive search in global optimization, The normal score transformation applied to a multi-univariate method of global optimization, Derivative-free simulated annealing and deflecting function technique for global optimization, Comparison of Kriging-based algorithms for simulation optimization with heterogeneous noise, Simplicial Lipschitz optimization without the Lipschitz constant, Stochastic techniques for global optimization: A survey of recent advances, Globally-biased disimpl algorithm for expensive global optimization, Bayesian stopping rules for multistart global optimization methods, A hybrid method combining continuous tabu search and Nelder--Mead simplex algorithms for the global optimization of multiminima functions, Improve-and-branch algorithm for the global optimization of nonconvex NLP problems, A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization, New modified function method for global optimization, Clustering methods for large scale geometrical global optimization, A deterministic algorithm for global optimization, The filled function transformations for constrained global optimization, Interval method for bounding level sets: Revisited and tested with global optimization problems
