Simplicial Partitions in Global Optimization | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …

For several years, parts of the content of this textbook have been used in undergraduate
courses in the Department of Mathematics and in the Faculty of Economics at the University …

Transportation infrastructure, such as road or railroad networks, represent a fundamental
component of our civilization. For sustainable planning and informed decision making, a …

In this paper, we propose a modification of the well-known DBSCAN algorithm, which
recognizes clusters with various data densities in a given set of data points A={a^ i ∈ R^ n …

Global optimization algorithms discussed in the previous chapter, use the global estimate of
the Lipschitz constant L given a priori and do not take into account the local information …

A possibility of applying the density-based clustering algorithm Rough-DBSCAN for
earthquake zoning is considered in the paper. By using density-based clustering for …

In this paper, we consider a global optimization problem for a symmetric Lipschitz
continuous function. An efficient modification of the well-known DIRECT (DIviding …

In this paper a new fast partitioning algorithm able to find either a globally optimal partition or
a locally optimal partition of the set A⊂ R n close to the global one is proposed. The …

Motivated by the problem of identifying rod-shaped particles (eg bacilliform bacterium), in
this paper we consider the multiple generalized circle detection problem. We propose a …

This paper proposes a new efficient method for line detection based on known incremental
methods of searching for an approximate globally optimal partition of a set of data points A …