SymDIRECT

swMATH22239MaRDI QIDQ34034

No author found.

Described by source

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

Related Items (16)

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

This page was built for software: SymDIRECT