APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
From MaRDI portal
Recommendations
Cites work
- A Subexponential Algorithm for Abstract Optimization Problems
- A simple algorithm for computing the smallest enclosing circle
- COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- Linear Programming in Linear Time When the Dimension Is Fixed
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- On the Minimum Volume Covering Ellipsoid of Ellipsoids
- On the ball spanned by balls
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- The space complexity of approximating the frequency moments
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
Cited in
(26)- Solving \(k\)-center problems involving sets based on optimization techniques
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- Clustering in Hilbert's projective geometry: the case studies of the probability simplex and the elliptope of correlation matrices
- Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls
- Smallest enclosing ball for probabilistic data
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- On the smallest enclosing information disk
- On a minimum enclosing ball of a collection of linear subspaces
- On approximating the Riemannian 1-center
- Averaging symmetric positive-definite matrices
- Smallest enclosing spheres and Chernoff points in Bregman geometry
- Approximating covering and minimum enclosing balls in hyperbolic geometry
- A faster dual algorithm for the Euclidean minimum covering ball problem
- New approximation algorithms for minimum enclosing convex shapes
- On approximating the smallest enclosing Bregman Balls
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem
- The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
- A hybrid algorithm for the minimum bounding sphere problem
- Minimal time functions and the smallest intersecting ball problem with unbounded dynamics
- Computational Science and Its Applications – ICCSA 2004
- Geometric matrix midranges
- Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography
- Fast Learning of Generalized Minimum Enclosing Ball for Large Datasets
- A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality
This page was built for publication: APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3647614)
