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
type: Item
instance of: scholarly article
title: 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
zbMATH Open document ID: 1461.65185
author: Rudolf Scitovski
author: Kristian Sabo
published in: Journal of Global Optimization
publication date: 2019-06-20T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7069294
zbMATH Keywords: globally optimal partition
zbMATH Keywords: \(k\)-means
zbMATH Keywords: incremental algorithm
zbMATH Keywords: direct
zbMATH Keywords: multiple circles detection problem
describes a project that uses: flexclust
describes a project that uses: SIGOA
describes a project that uses: SymDIRECT
MaRDI profile type: Publication
full work available at URL: s10898-019-00743-8
OpenAlex ID: W2912803520
cites work: Least-squares orthogonal distances fitting of circle, sphere, ellipse, hyperbola, and parabola
cites work: Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
cites work: Fast modified global \(k\)-means algorithm for incremental cluster construction
cites work: Q4490109
cites work: Circular and Linear Regression
cites work: A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
cites work: Q4889854
cites work: Lipschitzian optimization without the Lipschitz constant
cites work: Q3444817
cites work: Lipschitz gradients for global optimization in a one-point-based partitioning scheme
cites work: A toolbox for \(K\)-centroids cluster analysis
cites work: Global optimization. Theory, algorithms, and applications
cites work: A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
cites work: Globally-biased disimpl algorithm for expensive global optimization
cites work: Simplicial Global Optimization
cites work: Simplicial Lipschitz optimization without the Lipschitz constant
cites work: Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
cites work: One-dimensional center-based l 1-clustering method
cites work: 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
cites work: A deterministic global optimization using smooth diagonal auxiliary functions
cites work: Q3321259
cites work: Global optimality in \(k\)-means clustering
cites work: Q3514009
DOI: 10.1007/S10898-019-00743-8
Recommended article: EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
Recommended article: Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
Recommended article: DIRECT algorithm: A new definition of potentially optimal hyperrectangles
Recommended article: A parallel algorithm for partitioning a point set to minimize the maximum of diameters
Recommended article: A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
Recommended article: A fixed parameter algorithm for optimal convex partitions
Recommended article: 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.
Recommended article: Q3796749
Recommended article: Q747294
Recommended article: Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
description: scientific article