TY - JOUR

T1 - Finding the distance between ellipsoids

AU - Tamasyan, G.S.

AU - Chumakov, A.A.

PY - 2014

Y1 - 2014

N2 - Under study is the problem of finding the nearest points from one ellipsoid to the other. Some new algorithms for solving this problem are constructed, using the theory of exact penalty functions and nonsmooth analysis. We propose two iterative methods of (steepest and hypodifferential) descent. The new algorithms (as compared with those previously known) have specific advantages; in particular, they are universal and less labor-consuming. Software for implementing these algorithms is developed inMATLAB and Maple.

AB - Under study is the problem of finding the nearest points from one ellipsoid to the other. Some new algorithms for solving this problem are constructed, using the theory of exact penalty functions and nonsmooth analysis. We propose two iterative methods of (steepest and hypodifferential) descent. The new algorithms (as compared with those previously known) have specific advantages; in particular, they are universal and less labor-consuming. Software for implementing these algorithms is developed inMATLAB and Maple.

KW - nonsmooth analysis

KW - nearest distance

KW - ellipsoid

KW - exact penalty function

KW - subdifferential

KW - method of hypodifferential descent

U2 - 10.1134/S1990478914030132

DO - 10.1134/S1990478914030132

M3 - Article

VL - 8

SP - 400

EP - 410

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 3

ER -