On the elimination of inessential points in the smallest enclosing ball problem

DOI10.1080/10556788.2017.1359266zbMATH Open1407.90257OpenAlexW2751982126MaRDI QIDQ4622883FDOQ4622883

Authors: Luc Pronzato 

Publication date: 18 February 2019

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2017.1359266

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

zbMATH Keywords

minimum enclosing ballcore setsoptimal design of experimentsChebyshev centresmallest ball

Mathematics Subject Classification ID

Convex programming (90C25) Optimal statistical designs (62K05) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• A numerically stable dual method for solving strictly convex quadratic programs
• Some algorithmic aspects of the theory of optimal designs
• The Equivalence of Two Extremum Problems
• Estimation of Correlation Coefficients by Ellipsoidal Trimming
• Title not available (Why is that?)
• Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
• Monotonic convergence of a general algorithm for computing optimal designs
• Title not available (Why is that?)
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• Two Algorithms for the Minimum Enclosing Ball Problem
• The Minimum Covering Sphere Problem
• Optimal design: Some geometrical aspects of D-optimality
• An algorithm for finding the Chebyshev center of a convex polyhedron
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
• Sequences converging to D-optimal designs of experiments
• A geometric approach to optimal design theory
• A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
• Optimal core-sets for balls
• Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
• Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
• Minimum-volume ellipsoids. Theory and algorithms
• Minimax and maximin space-filling designs: some properties and methods for construction
• Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem

Cited In (5)

• Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
• Removing inessential points in \(c\)-and \(A\)-optimal design
• Title not available (Why is that?)
• Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem
• The problem of a minimal ball enclosing k points

Uses Software

• Miniball

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)