A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets (Q6568951)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A method for searching for a globally optimal k-partition of higher-dimensional datasets |
scientific article; zbMATH DE number 7878113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets |
scientific article; zbMATH DE number 7878113 |
Statements
A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets (English)
0 references
8 July 2024
0 references
Lipschitz continuous function
0 references
global optimization
0 references
globally optimal \(k\)-partition
0 references
\texttt{DIRECT}
0 references
linear constrained problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8005453944206238
0 references
0.7846515774726868
0 references
0.7551615238189697
0 references
0.7411096096038818
0 references
0.7327293753623962
0 references
