Experiments with new stochastic global optimization search techniques
type: Item
instance of: scholarly article
title: Experiments with new stochastic global optimization search techniques
zbMATH Open document ID: 0967.90086
DOI: 10.1016/S0305-0548(99)00054-4
author: Linet Özdamar
author: Melek Demirhan
published in: Computers \& Operations Research
publication date: 2000-10-26T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1472352
zbMATH Keywords: probabilistic search methods
zbMATH Keywords: global optimization
zbMATH Keywords: adaptive partitioning algorithms
zbMATH Keywords: fuzzy measures
zbMATH Keywords: probabilistic search techniques
zbMATH Keywords: simulated annealing
zbMATH Keywords: clustering methods
describes a project that uses: simannf90
describes a project that uses: minpack
describes a project that uses: OPTAC
describes a project that uses: Genocop
describes a project that uses: ASA
MaRDI profile type: Publication
cites work: A wide class of test functions for global optimization
cites work: Quasi-Newton Methods for Unconstrained Optimization
cites work: A Rapidly Convergent Descent Method for Minimization
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Function minimization by conjugate gradients
cites work: Q5604993
cites work: Q4174540
cites work: Stochastic Methods for Global Optimization
cites work: Topographical multilevel single linkage
cites work: Topographical global optimization using pre-sampled points
cites work: Optimization by Simulated Annealing
cites work: Global optimization and simulated annealing
cites work: Simulated annealing: Practice versus theory
cites work: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
cites work: The impact of accelerating tools on the interval subdivision algorithm for global optimization
cites work: Q4851605
cites work: On the selection of subdivision directions in interval branch-and-bound methods for global optimization
cites work: Convergence qualification of adaptive partition algorithms in global optimization
cites work: A Sequential Method Seeking the Global Maximum of a Function
cites work: Q3908420
cites work: Two algorithms for one-dimensional multimodai minimization
cites work: Q3207999
cites work: Inclusion functions and global optimization. II
cites work: A probabilistic algorithm for global optimization
cites work: Q4177353
cites work: Q4885610
cites work: Simultaneous lot sizing and loading of product families on parallel facilities of different classes
cites work: Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
cites work: Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
cites work: A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory
cites work: Q5287558
cites work: OPTAC: A portable software package for analyzing and comparing optimization methods by visualization
cites work: Computing the topological degree of a mapping in \(R^n\)
cites work: A curvilinear optimization method based upon iterative estimation of the eigensystem of the Hessian matrix
cites work: Testing Unconstrained Optimization Software
cites work: An efficient degree-computation method for a generalized method of bisection
cites work: Q4315824
cites work: Q5659396
cites work: Q3928146
cites work: Global optimization
cites work: Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
cites work: Global optimization and stochastic differential equations
cites work: A deterministic algorithm for global optimization
cites work: A comparison of Bayesian/sampling global optimization techniques
cites work: Q4370808
cites work: Generalized descent for global optimization
description: scientific article; zbMATH DE number 1472352