×

glcCluster

swMATH ID: 7545
Software Authors: TOMLAB
Description: glcCluster is a global optimization algorithm, developed by Prof.Dr. Kenneth Holmström. It is a hybrid algorithm, combining the DIRECT global optimization algorithm, a clustering algorithm and local search. glcCluster is using one of the following DIRECT algorithms: glcDirect (default), glcFast or glcSolve, for global search (Step 1). Step 2 is an adaptive clustering algorithm to find a suitable number of clusters, where the best point in each cluster is then used as an initial point for a local search (Step 3). The 4th step is to run the DIRECT algoirithm once again, to possibly improve. If the DIRECT algorithm improves the best point, a local search is finally made as Step 5 with the new best point(s) as starting points. The routine glcCluster implements an extended version of DIRECT that handles problems with both nonlinear and integer constraints.
Homepage: http://tomwiki.com/GlcCluster
Related Software: OQNLP; KELLEY; ORBIT; MCS; BRENT; OrthoMADS; EGO; UOBYQA; MultiMin; fminsearch; LINDOGlobal; SNOBFIT; DAKOTA; Spacemap; CMA-ES; IMFIL; Ipopt; BOBYQA; DFO; SPACE
Referenced in: 1 Publication

Referenced in 1 Serial

1 Journal of Global Optimization

Referencing Publications by Year