|
Avtomatika i Telemekhanika, 2015, Issue 10, Pages 113–130
(Mi at14295)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
System Analysis and Operations Research
On the problem polyhedral separability: a numerical solution
A. S. Strekalovsky, T. V. Gruzdeva, A. V. Orlov Matrosov Institute for System Dynamics and Control Theory, Siberian Branch of Russian Academy of Sciences, Irkutsk, Russia
Abstract:
Using the piecewise-linear function, consideration was given to the problem of separation of the sets whose convex hulls have nonempty intersections. For the problem of polyhedral separability, an algorithm to solve the equivalent optimization problem of seeking the family of separating hyperplanes was proposed and substantiated. Its efficiency was demonstrated by way of a numerical experiment.
Citation:
A. S. Strekalovsky, T. V. Gruzdeva, A. V. Orlov, “On the problem polyhedral separability: a numerical solution”, Avtomat. i Telemekh., 2015, no. 10, 113–130; Autom. Remote Control, 76:10 (2015), 1803–1816
Linking options:
https://www.mathnet.ru/eng/at14295 https://www.mathnet.ru/eng/at/y2015/i10/p113
|
Statistics & downloads: |
Abstract page: | 223 | Full-text PDF : | 70 | References: | 56 | First page: | 18 |
|