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

DOI10.1080/10556788.2017.1359266zbMath1407.90257OpenAlexW2751982126MaRDI QIDQ4622883

Luc Pronzato

Publication date: 18 February 2019

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

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

zbMATH Keywords

minimum enclosing ballcore setsoptimal design of experimentsChebyshev centresmallest ball

Mathematics Subject Classification ID

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

Related Items (2)

Removing inessential points in \(c\)-and \(A\)-optimal design ⋮ Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem

Uses Software

• Miniball

Cites Work

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

This page was built for publication: On the elimination of inessential points in the smallest enclosing ball problem