Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
type: Item
instance of: scholarly article
title: Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
zbMATH Open document ID: 0976.90124
DOI: 10.1016/S0165-0114(98)00364-9
author: Linet Özdamar
author: Melek Demirhan
published in: Fuzzy Sets and Systems
publication date: 2001-03-20T00:00:00Z
Mathematics Subject Classification ID: 90C70
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 1563528
zbMATH Keywords: measure of fuzziness
zbMATH Keywords: adaptive partitioning algorithm
zbMATH Keywords: random search
zbMATH Keywords: global optimum of multimodal functions
describes a project that uses: minpack
describes a project that uses: simannf90
describes a project that uses: ASA
describes a project that uses: Genocop
MaRDI profile type: Publication
cites work: Topographical multilevel single linkage
cites work: Global optimization and stochastic differential equations
cites work: A probabilistic algorithm for global optimization
cites work: A curvilinear optimization method based upon iterative estimation of the eigensystem of the Hessian matrix
cites work: A deterministic algorithm for 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 simulated annealing
cites work: A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory
cites work: FRACTOP: A geometric partitioning metaheuristic for global optimization
cites work: Q4692508
cites work: Q4889854
cites work: Q4885610
cites work: Stochastic Methods for Global Optimization
cites work: Q4096943
cites work: An efficient degree-computation method for a generalized method of bisection
cites work: Q3928146
cites work: Q4315824
cites work: Q4177353
cites work: Q3207999
cites work: Inclusion functions and global optimization. II
cites work: Testing Unconstrained Optimization Software
cites work: Convergence qualification of adaptive partition algorithms in global optimization
cites work: Q5289009
cites work: Q4177355
cites work: On the selection of subdivision directions in interval branch-and-bound methods for global optimization
cites work: Q5659396
cites work: A Sequential Method Seeking the Global Maximum of a Function
cites work: Computing the topological degree of a mapping in \(R^n\)
cites work: Q3908420
cites work: Adaptive partitioned random search to global optimization
cites work: Q4174540
cites work: Topographical global optimization using pre-sampled points
cites work: Global optimization
cites work: Two algorithms for one-dimensional multimodai minimization
full work available at URL: s0165-0114(98)00364-9
OpenAlex ID: W2165383746
description: scientific article; zbMATH DE number 1563528