Using the Ellipsoid Method for Sylvester's Problem and its Generalization
| Autor: | Petro Stetsyuk, Olha Khomiak, Oleksander Davydov |
|---|---|
| Jazyk: | English<br />Ukrainian |
| Rok vydání: | 2024 |
| Předmět: | |
| Zdroj: | Кібернетика та комп'ютерні технології, Iss 1, Pp 27-46 (2024) |
| Druh dokumentu: | article |
| ISSN: | 2707-4501 2707-451X |
| DOI: | 10.34229/2707-451X.24.1.3 |
| Popis: | Sylvester's problem or the problem of the smallest bounding circle is the problem of constructing a circle of the smallest radius that contains a finite set of points on the plane. In n-dimensional space, it corresponds to the problem of the smallest bounding hypersphere, which can be formulated as the problem of minimizing a convex piecewise quadratic function. The article is dedicated to study of the ellipsoid method application for solving this problem and the minimax convex programming problem, which is equivalent to the generalized problem of the smallest bounding hypersphere. The generalized problem consists in finding the center of a sphere in an n-dimensional space that has a minimal radius and contains a finite set of n-dimensional spheres given by their centers and radii. The article consists of 3 sections. Section 1 describes the emshor algorithm – the algorithm of the ellipsoid method for problem of minimization of an arbitrary convex function, proves its convergence theorems, gives a geometric interpretation of the algorithm, which is based on the use of a minimum volume ellipsoid. Octave implementation of the emshor algorithm is presented here, which can be successfully applied for non-smooth convex functions minimization if the number of variables is n = 2 - 30. In Section 2, the sylvester1 algorithm is built, which is an application of the emshor algorithm for solving the problem of minimizing a convex piecewise quadratic function, which is equivalent to the problem of finding a sphere of minimum radius for a finite set of points. In Section 3, the sylvester2 algorithm is built, which is an application of the emshor algorithm for solving the problem of minimization of a convex function, which is equivalent to the generalized problem of finding a sphere of minimum radius for a finite set of spheres with given centers and radii. The results of testing the sylvester1 and sylvester2 algorithms demonstrate high working speed for modern computers and high accuracy in terms of optimal value of the objective function when solving problems in n-dimensional spaces for small values n = 2 - 30. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|