Advertisement

Finding the distance between ellipsoids

  • G. Sh. Tamasyan
  • A. A. Chumakov
Article

Abstract

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.

Keywords

nonsmooth analysis nearest distance ellipsoid exact penalty function subdifferential method of hypodifferential descent 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. F. Dem’yanov, “Exact Penalty Functions in Problems of Nonsmooth Optimization,” Vestn. St.-Peterbg. Univ. Ser. I, No. 4, 21–27 (1994) [Vestnik St.-Petersburg Univ. Math. 27 (4), 16–22 (1994)].Google Scholar
  2. 2.
    V. F. Dem’yanov, Conditions of Extremum and Calculus of Variations (Vysshaya Shkola, Moscow, 2005) [in Russian].Google Scholar
  3. 3.
    V. F. Dem’yanov and L. V. Vasil’ev, Nondifferentiable Optimization (Nauka, Moscow, 1981; Optimization Software, New York, 1985.)MATHGoogle Scholar
  4. 4.
    V. F. Dem’yanov and A. M. Rubinov, Foundations of Nonsmooth Analysis and Quasidifferential Calculus (Nauka, Moscow, 1990) [in Russian].MATHGoogle Scholar
  5. 5.
    I. I. Eremin, “The’ Penalty’ Method in Convex Programming,” Dokl. Akad. Nauk SSSR 173(4), 748–751 (1967) [Sov. Math. Dokl. 8, 459–462 (1967)].MathSciNetGoogle Scholar
  6. 6.
    E. A. Kalinina and A. Yu. Uteshev, Exclusion Theory: a Textbook (NII Khimii St.-Petersburg. Gos. Univ., St. Petersburg, 2002) [in Russian].Google Scholar
  7. 7.
    A. I. Kosolap, “Quadratic Optimization Problems of Computer Geometry,” Iskusstv. Intellekt, No. 1, 70–75.Google Scholar
  8. 8.
    D. M. Lebedev and L. N. Polyakova, “The Problem of Pprojecting the Origin on a Quadric,” Vestnik St.-Peterbg. Univ. Ser. 10, No. 14, 11–17 (2013).Google Scholar
  9. 9.
    G. Sh. Tamasyan, “On Methods of Steepest and Hypodiffernetial Descent in one Problem of Calculus of Variations,” Comp. Methods and Comp. Sci. 13, 197–217 (2012).Google Scholar
  10. 10.
    A. Yu. Uteshev, Computation of Distances between Geometric Objects, http://pmpu.ru/vf4/algebra2/optimiz/distance.
  11. 11.
    A. Yu. Uteshev and M. V. Yashina, “Computation of the Distance from an Ellipsoid to a Linear Surface and a Quadric in ℝn,” Dokl. Akad. Nauk 419(4), 471–474 (2008) [Dokl. Math. 77 (2), 269–272 (2008)].MathSciNetGoogle Scholar
  12. 12.
    A. Lin and S. P. Han, “On the Distance between Two Ellipsoids,” SIAM J. Optim. 13, 298–308 (2002).CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Pleiades Publishing, Ltd. 2014

Authors and Affiliations

  1. 1.Saint Petersburg State UniversityPeterhof, Saint PetersburgRussia

Personalised recommendations