Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach
From MaRDI portal
Publication:1675553
DOI10.1007/s10898-016-0464-yzbMath1379.51008OpenAlexW2523179463MaRDI QIDQ1675553
Alberto Seeger, José Vidal-Nuñez
Publication date: 2 November 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0464-y
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Length, area and volume in real or complex geometry (51M25) Convex sets and cones of operators (47L07)
Related Items
On spectral maps induced by convex cones, Inscribed and circumscribed ellipsoidal cones: volume ratio analysis, Unnamed Item, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inradius and circumradius of various convex cones arising in applications
- John and Loewner ellipsoids
- On properties of different notions of centers for convex cones
- Positive operators on the \(n\)-dimensional ice cream cone
- Solidity indices for convex cones
- An illumination problem: optimal apex and optimal orientation for a cone of light
- Centers and partial volumes of convex cones. I: Basic theory
- Invariant ellipsoidal cones
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Central axes and peripheral points in high dimensional directional datasets
- Cones, matrices and mathematical programming
- The Relaxation Method for Solving Systems of Linear Inequalities
- Variational Analysis
- Computation of Minimum-Volume Covering Ellipsoids
- Two characterizations of ellipsoidal cones
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- The Theory of Max-Min, with Applications
- Convex Analysis
- Conic version of Loewner-John ellipsoid theorem
