Skip to main content
SpringerLink
Log in

Finding the distance between ellipsoids

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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. V. F. Dem’yanov, Conditions of Extremum and Calculus of Variations (Vysshaya Shkola, Moscow, 2005) [in Russian].

    Google Scholar 

  3. V. F. Dem’yanov and L. V. Vasil’ev, Nondifferentiable Optimization (Nauka, Moscow, 1981; Optimization Software, New York, 1985.)

    MATH  Google Scholar 

  4. V. F. Dem’yanov and A. M. Rubinov, Foundations of Nonsmooth Analysis and Quasidifferential Calculus (Nauka, Moscow, 1990) [in Russian].

    MATH  Google Scholar 

  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)].

    MathSciNet  Google Scholar 

  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. A. I. Kosolap, “Quadratic Optimization Problems of Computer Geometry,” Iskusstv. Intellekt, No. 1, 70–75.

  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. 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. A. Yu. Uteshev, Computation of Distances between Geometric Objects, http://pmpu.ru/vf4/algebra2/optimiz/distance.

  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)].

    MathSciNet  Google Scholar 

  12. A. Lin and S. P. Han, “On the Distance between Two Ellipsoids,” SIAM J. Optim. 13, 298–308 (2002).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Saint Petersburg State University, Universitetskii pr. 35, Peterhof, Saint Petersburg, 198504, Russia

    G. Sh. Tamasyan & A. A. Chumakov

Authors
  1. G. Sh. Tamasyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Chumakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. Sh. Tamasyan.

Additional information

Original Russian Text © G. Sh. Tamasyan, A. A. Chumakov, 2014, published in Diskretnyi Analiz i Issledovanie Operatsii, 2014, Vol. 21, No. 3, pp. 87–102.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tamasyan, G.S., Chumakov, A.A. Finding the distance between ellipsoids. J. Appl. Ind. Math. 8, 400–410 (2014). https://doi.org/10.1134/S1990478914030132

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478914030132

Keywords

Search

Navigation