Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?
DOI10.1007/s10957-020-01762-2zbMath1462.52032arXiv1804.06699OpenAlexW3093583216MaRDI QIDQ2025288
Publication date: 11 May 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.06699
computational geometrypolynomial time complexityvertex enumerationnonconvex quadratically constrained quadratic programmingball covering problemVoronoi-like polyhedron
Nonconvex programming, global optimization (90C26) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Sequential statistical analysis (62L10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Uses Software
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On optimal multiple changepoint algorithms for large data
- A pruned dynamic programming algorithm to recover the best segmentations with $1$ to $K_{max}$ change-points
- Computing the volume of the union of spheres
- Algorithms for the optimal identification of segment neighborhoods
- Helly-type theorems for spheres
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Covering a ball with smaller equal balls in \(\mathbb R^n\)
- On convex relaxations for quadratically constrained quadratic programming
- Covering a ball by smaller balls
- A spherical Hellytype theorem
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Computing the volume of a union of balls
- On the complexity of four polyhedral set containment problems
- Randomized Algorithms for Optimal Solutions of Double-Sided QCQP With Applications in Signal Processing
- Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
- Changepoint Detection in the Presence of Outliers
- Volume of the intersection of three spheres
This page was built for publication: Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?
