On numerical solving the spherical separability problem

On numerical solving the spherical separability problem

The separation problem of two sets, whose convex hulls have a nonempty intersection, is considered. In order to find a solution of the problem algorithms of local and global search are developed. The efficiency of the algorithms is demonstrated by computational simulations on test examples.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of global optimization 2016-09, Vol.66 (1), p.21-34
Hauptverfasser: Gaudioso, M., Gruzdeva, T. V., Strekalovsky, A. S.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Computation
Computational geometry
Computer Science
Computer simulation
Control theory
Convex analysis
Hulls (structures)
Mathematical models
Mathematics
Mathematics and Statistics
Methods
Operations Research/Decision Theory
Optimization
Real Functions
Searching
Studies
Systems analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The separation problem of two sets, whose convex hulls have a nonempty intersection, is considered. In order to find a solution of the problem algorithms of local and global search are developed. The efficiency of the algorithms is demonstrated by computational simulations on test examples.
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-015-0319-y