|
Diskretnyi Analiz i Issledovanie Operatsii, 2014, Volume 21, Issue 3, Pages 87–102
(Mi da779)
|
|
|
|
This article is cited in 17 scientific papers (total in 17 papers)
Finding the distance between the ellipsoids
G. Sh. Tamasyan, A. A. Chumakov St. Petersburg State University, 35 Universitetskiy Ave.,
198504 Peterhof, St. Petersburg, Russia
Abstract:
The problem of finding the nearest points between two ellipsoids is considered. New algorithms for solving this problem were constructed using the theory of exact penalty functions and nonsmooth analysis. We propose two iterative methods of (steepest and hypodifferential) descent. New algorithms (as compared with previously known) have specific advantages, in particular, they are universal and less labor-intensive. The software which implements these algorithms was developed in MATLAB and Maple environment. Bibliogr. 12.
Keywords:
nonsmooth analysis, nearest distance, ellipsoid, exact penalty, subdifferential, method of hypodifferential descent.
Received: 02.09.2013 Revised: 11.11.2013
Citation:
G. Sh. Tamasyan, A. A. Chumakov, “Finding the distance between the ellipsoids”, Diskretn. Anal. Issled. Oper., 21:3 (2014), 87–102; J. Appl. Industr. Math., 8:3 (2014), 400–410
Linking options:
https://www.mathnet.ru/eng/da779 https://www.mathnet.ru/eng/da/v21/i3/p87
|
Statistics & downloads: |
Abstract page: | 493 | Full-text PDF : | 179 | References: | 89 | First page: | 12 |
|