Cited in
(25)- Interpretation and optimization of the \(k\)-means algorithm.
- Globally-biased disimpl algorithm for expensive global optimization
- Research project grouping and ranking by using adaptive Mahalanobis clustering
- The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm.
- DIRECTLib
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- The DIRECT algorithm: 25 years later
- Parameter estimation in ordinary differential equations modeling via particle swarm optimization
- LGO
- TRIOPT
- DIRECT
- flexclust
- SIGOA
- GEATbx
- Adaptive block coordinate DIRECT algorithm
- IPscatt
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
- DIRDFN
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
- Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Simplicial Lipschitz optimization without the Lipschitz constant
- Center-based \(l_1\)-clustering method
- Searching for an optimal partition of incomplete data with application in modeling energy efficiency of public buildings
- Incremental method for multiple line detection problem -- iterative reweighted approach
This page was built for software: SymDIRECT
