A stochastic method for global optimization
From MaRDI portal
Publication:3039049
DOI10.1007/BF01581033zbMath0525.90076MaRDI QIDQ3039049
G. Th. Timmer, Alexander H. G. Rinnooy Kan, C. Guus E. Boender, Leen Stougie
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
global optimizationclusteringlocal searchconfidence intervalrandom samplingcomputational experiencecomparison of algorithmsstochastic method
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)
Related Items
Using a derivative-free optimization method for multiple solutions of inverse transport problems, A multi-start global minimization algorithm with dynamic search trajectories, Multistart method with estimation scheme for global satisfycing problems, Global optimization on convex sets, A filled function method for global optimization, Cluster Gauss-Newton method. An algorithm for finding multiple approximate minimisers of nonlinear least squares problems with applications to parameter estimation of pharmacokinetic models, A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem, Empirical study of the improved UNIRANDI local search method, Globally convergent methods for n-dimensional multiextremal optimization, Verified solution of large systems and global optimization problems, A branch-and-bound algorithm for bound constrained optimization problems without derivatives, Derivative-free optimization: a review of algorithms and comparison of software implementations, A stochastic optimization algorithm for analyzing planar central and balanced configurations in the \(n\)-body problem, A quasi-multistart framework for global optimization of expensive functions using response surface models, An optimization approach to robust nonlinear control design, Pure adaptive search in Monte Carlo optimization, A parallel global optimization algorithm inspired by quantum physics, Newtonian clustering: an approach based on molecular dynamics and global optimization, New global optimization methods for ship design problems, Scatter search for chemical and bio-process optimization, Approximate global optimization with convexity estimation of response surface using Kriging method, The New Arsti Optimization Method: Adaptive Random Search with Translating Intervals, Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem, Stochastic Methods for Global Optimization, Confidence Limits for Global Optima Based on Heuristic Solutions to Difficult Optimization Problems: A Simulation Study, Bayesian nonparametrie inference and monte carlo optimization, Methods of continuation and their implementation in the COCO software platform with application to delay differential equations, Stochastic global optimization methods part I: Clustering methods, Concurrent stochastic methods for global optimization, Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure, Case study on statistically estimating minimum makespan for flow line scheduling problems., Heuristics from Nature for Hard Combinatorial Optimization Problems, The GLOBAL optimization method revisited, Convergence qualification of adaptive partition algorithms in global optimization, Stochastic techniques for global optimization: A survey of recent advances, Bayesian stopping rules for multistart global optimization methods, The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization, MinFinder: locating all the local minima of a function, Stochastic approximation algorithms: overview and recent trends., A parallel algorithm for global optimization, The impact of accelerating tools on the interval subdivision algorithm for global optimization, Dynamic globally concavized filled function method for continuous global optimization, The globally convexized filled functions for global optimization, Derivative-free optimization methods, Towards ``Ideal multistart. A stochastic approach for locating the minima of a continuous function inside a bounded domain, Modular Parameter Identification of Biomolecular Networks, Identification of region of attraction for global optimization problem using interval symmetric operator, Extensions of the Bartlett-Lewis model for rainfall processes, Extended univariate algorithms for \(n\)-dimensional global optimization, Comparison of public-domain software for black box global optimization∗, Optimal coverage of convex regions, Alternative sampling strategy for a random optimization algorithm, Lipschitzian optimization without the Lipschitz constant
Cites Work
