On the Distance between Two Ellipsoids

DOI10.1137/S1052623401396510zbMath1027.49026OpenAlexW2079370437MaRDI 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

optimizationalgorithmdistanceellipsoidconvex

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (15)

Numerical algorithm of multipole expansion method for conductivity of ellipsoidal particle composite ⋮ A Review on Contact and Collision Methods for Multi-Body Hydrodynamic Problems in Complex Flows ⋮ Comparison of methods computing the distance between two ellipsoids ⋮ Computing the Signed Distance Between Overlapping Ellipsoids ⋮ A procedure for efficient generation and behavioral evaluation of ultra‐packed ellipsoidal particle systems ⋮ On convex numerical schemes for inelastic contacts with friction ⋮ Metric problems for quadrics in multidimensional space ⋮ Approximations and lower bounds for the length of minimal Euclidean Steiner trees ⋮ 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 ⋮ Alternative second-order cone programming formulations for support vector classification ⋮ Charged ball method for solving some computational geometry problems ⋮ Interface-resolved direct numerical simulations of the interactions between spheroidal particles and upward vertical turbulent channel flows ⋮ Finding the distance between ellipsoids ⋮ Strong alignment of prolate ellipsoids in Taylor–Couette flow

This page was built for publication: On the Distance between Two Ellipsoids