Computing the signed distance between overlapping ellipsoids
From MaRDI portal
Recommendations
Cites work
- A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
- A note on polynomial solvability of the CDT problem
- A unified classification model based on robust optimization
- Accuracy and Stability of Numerical Algorithms
- Computing curve intersection by means of simultaneous iterations
- Computing the common zeros of two bivariate functions via Bézout resultants
- scientific article; zbMATH DE number 3903874 (Why is no real title available?)
- scientific article; zbMATH DE number 3756646 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Minimum distance to the complement of a convex set: Duality result
- Multiparameter eigenvalue problems. Volume I: Matrices and compact operators
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- On linearizations of the quadratic two-parameter eigenvalue problem
- On the Distance between Two Ellipsoids
- On the quadratic two-parameter eigenvalue problem and its linearization
- On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere
- Packing ellipsoids with overlap
- Polynomial two-parameter eigenvalue problems and matrix pencil methods for stability of delay-differential equations
- Second order cone programming formulations for feature selection
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- The Bezoutian and the eigenvalue-separation problem for matrix polynomials
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- The quadratic eigenvalue problem
Cited in
(10)- On the interference problem for ellipsoids: experiments and applications
- Variational analysis on the signed distance functions
- Comparison of methods computing the distance between two ellipsoids
- On the singular two-parameter eigenvalue problem. II
- The alternating direction method of multipliers for finding the distance between ellipsoids
- Solving generalized CDT problems via two-parameter eigenvalues
- On the Distance between Two Ellipsoids
- Finding the distance between ellipsoids
- A hidden variable resultant method for the polynomial multiparameter eigenvalue problem
- A Contour Method for Multiparameter Eigenvalue Problems
This page was built for publication: Computing the signed distance between overlapping ellipsoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454510)
