On the distance between two ellipsoids

SIAM Journal on Optimization

Volumn 13, Issue 1, 2003, Pages 298-308

  Lin, Anhua ^a   Han, Shih Ping ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

Algorithm; Convex; Distance; Ellipsoid; Optimization

Indexed keywords

EID: 0037288632     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623401396510     Document Type: Article

References (9)

1. R. FLETCHER, Practical Methods of Optimization, 2nd ed., Wiley, New York, 1991.
2. B. S. HE, Solving trust region problems in large scale optimization, J. Comput. Math., 18 (2000), pp. 1-12.
3. L. T. HOAI AN, An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints, Math. Programming, 87 (2000), pp. 401-426.
4. A. LIN AND S.-P. HAN, Projection on an Ellipsoid, submitted, 2001.
5. O. L. MANGASARIAN, Nonlinear Programming, Classics Appl. Math. 10, SIAM, Philadelphia, 1994.
6. J. J. MORÉ, The Levenberg-Marquardt algorithm: Implementation and theory, in Numerical Analysis: Lecture Notes in Math. 630, G. A. Watson, ed., Springer-Verlag, Berlin, 1977, pp. 105-116.
7. J. J. MORÉ AND D. C. SORENSON, Computing a trust region step, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 553-572.
8. T. P. DINH AND L. T. HOAI AN, A D.C. optimization algorithm for solving the trust-region subproblem, SIAM J. Optim., 8 (1998), pp. 476-505.
9. D. SORENSEN, Minimization of a large-scale quadratic function subject to a spherical constraint, SIAM J. Optim., 7 (1997), pp. 141-161.