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

DOI10.1007/S10898-024-01372-6zbMATH Open1543.65086MaRDI QIDQ6568951FDOQ6568951

Authors: Kristian Sabo, Rudolf Scitovski, Sime Ungar, Zoran Tomljanović 

Publication date: 8 July 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Recommendations

• 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
• 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
• Set partition by globally optimized cluster seed points
• Interpretation and optimization of the \(k\)-means algorithm.
• Global optimality in \(k\)-means clustering

zbMATH Keywords

global optimizationLipschitz continuous function\texttt{DIRECT}globally optimal \(k\)-partitionlinear constrained problem

Mathematics Subject Classification ID

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

Cites Work

• PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
• A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
• Lipschitzian optimization without the Lipschitz constant
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Introduction to clustering large and high-dimensional data.
• Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
• Lipschitz global optimization methods in control problems
• Three points method for searching the best least absolute deviations plane
• Globally-biased disimpl algorithm for expensive global optimization
• Parallel global optimization on GPU
• Global optimization. Scientific and engineering case studies
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• Stochastic global optimization.
• A univariate global search working with a set of Lipschitz constants for the first derivative
• A global optimization technique for checking parametric robustness
• Two Methods for Solving Optimization Problems Arising in Electronic Measurements and Electrical Engineering
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• A deterministic approach to global box-constrained optimization
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
• One-dimensional P-algorithm with convergence rate \(O(n^{-3+\delta})\) for smooth functions
• Simplicial global optimization
• An approach to cluster separability in a partition
• Spectral clustering with eigenvector selection
• Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
• 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
• Cluster Analysis and Applications
• 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
• 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
• The DIRECT algorithm: 25 years later
• A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
• Partitional clustering via nonsmooth optimization. Clustering via 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.
• 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)