Computing the Signed Distance Between Overlapping Ellipsoids
From MaRDI portal
Publication:3454510
DOI10.1137/140979654zbMath1334.49100OpenAlexW2220144476MaRDI QIDQ3454510
Yuji Nakatsukasa, Akiko Takeda, Satoru Iwata
Publication date: 25 November 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a5f94960f56410d83362fe69c5ab13e1ff124441
nonconvex optimizationcomputational algorithmellipsoidsKKT conditionsMinkowski differencetwo-parameter eigenvalue problemsigned distance
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on necessary conditions (49M05) Numerical methods based on nonlinear programming (49M37)
Related Items
On the singular two-parameter eigenvalue problem. II, Variational analysis on the signed distance functions, The alternating direction method of multipliers for finding the distance between ellipsoids, Solving Generalized CDT Problems via Two-Parameter Eigenvalues
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On linearizations of the quadratic two-parameter eigenvalue problem
- Multiparameter eigenvalue problems. Volume I: Matrices and compact operators
- Computing curve intersection by means of simultaneous iterations
- On the quadratic two-parameter eigenvalue problem and its linearization
- Polynomial two-parameter eigenvalue problems and matrix pencil methods for stability of delay-differential equations
- Minimum distance to the complement of a convex set: Duality result
- The Bezoutian and the eigenvalue-separation problem for matrix polynomials
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Computing the common zeros of two bivariate functions via Bézout resultants
- The Quadratic Eigenvalue Problem
- A Note on Polynomial Solvability of the CDT Problem
- Packing Ellipsoids with Overlap
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
- Accuracy and Stability of Numerical Algorithms
- On the Distance between Two Ellipsoids
- A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
- A Unified Classification Model Based on Robust Optimization
- On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere
