Experiments with new stochastic global optimization search techniques
From MaRDI portal
Publication:1571032
DOI10.1016/S0305-0548(99)00054-4zbMath0967.90086MaRDI QIDQ1571032
Publication date: 26 October 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
global optimizationsimulated annealingfuzzy measuresclustering methodsadaptive partitioning algorithmsprobabilistic search methodsprobabilistic search techniques
Related Items (9)
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ Global convergence and the Powell singular function ⋮ Differential evolution with preferential crossover ⋮ Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization ⋮ Investigating a hybrid simulated annealing and local search algorithm for constrained optimization ⋮ TRIOPT: A triangulation-based partitioning algorithm for global optimization ⋮ Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms ⋮ Design of manufacturing systems by a hybrid approach with neural network metamodelling and stochastic local search ⋮ Efficient hybrid methods for global continuous optimization based on simulated annealing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Global optimization and stochastic differential equations
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Inclusion functions and global optimization. II
- A probabilistic algorithm for global optimization
- Generalized descent for global optimization
- Global optimization and simulated annealing
- Convergence qualification of adaptive partition algorithms in global optimization
- Computing the topological degree of a mapping in \(R^n\)
- A curvilinear optimization method based upon iterative estimation of the eigensystem of the Hessian matrix
- An efficient degree-computation method for a generalized method of bisection
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- Simulated annealing: Practice versus theory
- Topographical global optimization using pre-sampled points
- Topographical multilevel single linkage
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
- A deterministic algorithm for global optimization
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- OPTAC: A portable software package for analyzing and comparing optimization methods by visualization
- A wide class of test functions for global optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- Stochastic Methods for Global Optimization
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Testing Unconstrained Optimization Software
- Two algorithms for one-dimensional multimodai minimization
- A comparison of Bayesian/sampling global optimization techniques
- Simultaneous lot sizing and loading of product families on parallel facilities of different classes
- A Rapidly Convergent Descent Method for Minimization
- Function minimization by conjugate gradients
- A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory
- A Sequential Method Seeking the Global Maximum of a Function
- Quasi-Newton Methods for Unconstrained Optimization
- Global optimization
This page was built for publication: Experiments with new stochastic global optimization search techniques
