Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
From MaRDI portal
Publication:1595195
DOI10.1016/S0165-0114(98)00364-9zbMath0976.90124OpenAlexW2165383746MaRDI QIDQ1595195
Publication date: 20 March 2001
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0165-0114(98)00364-9
random searchmeasure of fuzzinessadaptive partitioning algorithmglobal optimum of multimodal functions
Nonconvex programming, global optimization (90C26) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Related Items (2)
TRIOPT: A triangulation-based partitioning algorithm for global optimization ⋮ Experiments with new stochastic global optimization search techniques
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
- Unnamed Item
- Global optimization and stochastic differential equations
- Inclusion functions and global optimization. II
- A probabilistic algorithm 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
- FRACTOP: A geometric partitioning metaheuristic for global optimization
- Topographical global optimization using pre-sampled points
- Topographical multilevel single linkage
- A deterministic algorithm for global optimization
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization
- 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
- Adaptive partitioned random search to global optimization
- A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory
- A Sequential Method Seeking the Global Maximum of a Function
- Global optimization
This page was built for publication: Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
