On the Distance between Two Ellipsoids

DOI10.1137/S1052623401396510zbMath1027.49026MaRDI QIDQ4785882

Anhua Lin, Shih-Ping Han

Publication date: 5 January 2003

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623401396510

zbMATH Keywords

optimization; algorithm; distance; ellipsoid; convex

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C25: Convex programming

90C30: Nonlinear programming

49M37: Numerical methods based on nonlinear programming

Related Items

Strong alignment of prolate ellipsoids in Taylor–Couette flow, A Review on Contact and Collision Methods for Multi-Body Hydrodynamic Problems in Complex Flows, Interface-resolved direct numerical simulations of the interactions between spheroidal particles and upward vertical turbulent channel flows, Finding the distance between ellipsoids, Metric problems for quadrics in multidimensional space, Alternative second-order cone programming formulations for support vector classification, Numerical algorithm of multipole expansion method for conductivity of ellipsoidal particle composite, Comparison of methods computing the distance between two ellipsoids, Incorporating grain-scale processes in macroscopic sediment transport models. A review and perspectives for environmental and geophysical applications, The alternating direction method of multipliers for finding the distance between ellipsoids, Charged ball method for solving some computational geometry problems, Approximations and lower bounds for the length of minimal Euclidean Steiner trees, Computing the Signed Distance Between Overlapping Ellipsoids