Studies of multi-start clustering for global optimization
From MaRDI portal
Recommendations
- An approach to multi-start clustering for global optimization with non-linear constraints
- scientific article; zbMATH DE number 3912117
- Clustering methods for large scale geometrical global optimization
- Stochastic global optimization methods part I: Clustering methods
- The GLOBAL optimization method revisited
Cites work
- A hybrid genetic algorithm for nonconvex function minimization.
- An approach to multi-start clustering for global optimization with non-linear constraints
- Global optimization and simulated annealing
- Global optimization and stochastic differential equations
- scientific article; zbMATH DE number 1078157 (Why is no real title available?)
- scientific article; zbMATH DE number 757674 (Why is no real title available?)
- Integral global minimization: Algorithms, implementations and numerical tests
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Relaxing the assumptions of the multilevel single linkage algorithm
- Stochastic global optimization methods part II: Multi level methods
Cited in
(8)- Two strategies of adaptive cluster covering with descent and their comparison to other algorithms
- A new adaptive multi-start technique for combinatorial global optimizations
- Multistart with early termination of descents
- Some polynomial programming problems solving with a clustering algorithm
- A multistart gradient-based algorithm with surrogate model for global optimization
- scientific article; zbMATH DE number 1057699 (Why is no real title available?)
- An approach to multi-start clustering for global optimization with non-linear constraints
- The GLOBAL optimization method revisited
This page was built for publication: Studies of multi-start clustering for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530125)
