Finding the distance between ellipsoids

DOI10.1134/S1990478914030132zbMath1324.90196OpenAlexW1989304426MaRDI QIDQ5264745

A. A. Chumakov, G. Sh. Tamasyan

Publication date: 27 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478914030132

zbMATH Keywords

nonsmooth analysissubdifferentialellipsoidexact penalty functionnearest distancemethod of hypodifferential descend

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (9)

Comparison of methods computing the distance between two ellipsoids ⋮ Minimax Approach in a Multiple Criteria Stabilization of Singularly Perturbed Control ⋮ Comparative study of two fast algorithms for projecting a point to the standard simplex ⋮ Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function ⋮ Point-to-ellipse and point-to-ellipsoid distance equation analysis ⋮ Metric problems for quadrics in multidimensional space ⋮ The alternating direction method of multipliers for finding the distance between ellipsoids ⋮ Charged ball method for solving some computational geometry problems ⋮ The method of codifferential descent for convex and global piecewise affine optimization

Uses Software

• Maple
• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of the distance from an ellipsoid to a linear surface and a quadric in \(\mathbb R^n\)
• Exact penalty functions in problems of nonsmooth optimization
• On the Distance between Two Ellipsoids

This page was built for publication: Finding the distance between ellipsoids