SymDIRECT

swMATH22239MaRDI QIDQ34034FDOQ34034

Author name not available (Why is that?)

Described by source

• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function

Cited In (16)

• Globally-biased disimpl algorithm for expensive global optimization
• Incremental method for multiple line detection problem -- iterative reweighted approach
• 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
• Simplicial Lipschitz optimization without the Lipschitz constant
• A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
• The DIRECT algorithm: 25 years later
• A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
• Searching for an Optimal Partition of Incomplete Data with Application in Modeling Energy Efficiency of Public Buildings
• Interpretation and optimization of the \(k\)-means algorithm.
• Research project grouping and ranking by using adaptive Mahalanobis clustering
• Parameter estimation in ordinary differential equations modeling via particle swarm optimization
• Center-based l1–clustering method
• 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.
• 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
• Adaptive block coordinate DIRECT algorithm
• Application of reduced-set Pareto-Lipschitzian optimization to truss optimization

This page was built for software: SymDIRECT