On the elimination of inessential points in the smallest enclosing ball problem
From MaRDI portal
(Redirected from Publication:4622883)
Recommendations
- Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
- The problem of a minimal ball enclosing k points
- The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
- On the smallest enclosing balls
- Computational Science and Its Applications – ICCSA 2004
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- Complexity and approximation of the smallest k-enclosing ball problem
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- Smallest enclosing spheres and Chernoff points in Bregman geometry
- Efficient algorithms for the smallest enclosing ball problem
Cites work
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
- A geometric approach to optimal design theory
- A numerically stable dual method for solving strictly convex quadratic programs
- An algorithm for finding the Chebyshev center of a convex polyhedron
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
- Estimation of Correlation Coefficients by Ellipsoidal Trimming
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 800961 (Why is no real title available?)
- Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- Minimax and maximin space-filling designs: some properties and methods for construction
- Minimum-volume ellipsoids. Theory and algorithms
- Monotonic convergence of a general algorithm for computing optimal designs
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Optimal core-sets for balls
- Optimal design: Some geometrical aspects of D-optimality
- Sequences converging to D-optimal designs of experiments
- Some algorithmic aspects of the theory of optimal designs
- The Equivalence of Two Extremum Problems
- The Minimum Covering Sphere Problem
- Two Algorithms for the Minimum Enclosing Ball Problem
Cited in
(5)- Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem
- Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
- scientific article; zbMATH DE number 3913428 (Why is no real title available?)
- The problem of a minimal ball enclosing k points
- Removing inessential points in c-and A-optimal design
This page was built for publication: On the elimination of inessential points in the smallest enclosing ball problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622883)
