A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27) Computational aspects of data analysis and big data (68T09)

Cites Work

Title not available (Why is that?)
Parallel global optimization on GPU
A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
Lipschitz global optimization methods in control problems
An approach to cluster separability in a partition
Fast modified global \(k\)-means algorithm for incremental cluster construction
Three points method for searching the best least absolute deviations plane
Global optimization. Scientific and engineering case studies
Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
A univariate global search working with a set of Lipschitz constants for the first derivative
A global optimization technique for checking parametric robustness
Lipschitzian optimization without the Lipschitz constant
Global optimization with non-convex constraints. Sequential and parallel algorithms
One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
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
Lipschitz optimization methods for fitting a sum of damped sinusoids to a series of observations
GOSH: derivative-free global optimization using multi-dimensional space-filling curves
A deterministic approach to global box-constrained 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
Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
Partitional clustering via nonsmooth optimization. Clustering via optimization
Globally-biased disimpl algorithm for expensive global optimization
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.
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
Spectral clustering with eigenvector selection
Stochastic global optimization.
Simplicial Global Optimization
PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
Cluster Analysis and Applications
Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization

This page was built for publication: A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568951)