Solution methodologies for the smallest enclosing circle problem
DOI10.1023/A:1022977709811zbMATH Open1038.90080OpenAlexW2171409252MaRDI QIDQ1810982FDOQ1810982
Authors: Sheng Xu, Robert M. Freund, Jie Sun 
Publication date: 9 June 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022977709811
Recommendations
- Computing the smallest \(k\)-enclosing circle and related problems
- The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions
- A reformulation-linearization based algorithm for the smallest enclosing circle problem
- On the geometry of the smallest circle enclosing a finite set of points
- Computing the smallest k-enclosing circle and related problems
Nonlinear programming (90C30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (26)
- Approximate minimum enclosing balls in high dimensions using core-sets
- A new approximate algorithm for the Chebyshev center
- A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
- On a sequential linear programming approach to finding the smallest circumscribed, largest inscribed, and minimum zone circle or sphere
- The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- On the geometry of the smallest circle enclosing a finite set of points
- Approximations of differentiable convex functions on arbitrary convex polytopes
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- Chebyshev centres, Jung constants, and their applications
- A fast solver for the narrow capture and narrow escape problems in the sphere
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
- Efficient algorithms for the smallest enclosing ball problem
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
- Covering a set by a convex compactum: error estimates and computation
- A reformulation-linearization based algorithm for the smallest enclosing circle problem
- An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem
- An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
- Efficient Speed-Up of the Smallest Enclosing Circle Algorithm
- Chebyshev center and inscribed balls: properties and calculations
- Approximate calculation of the Chebyshev center for a convex compact set in \(\mathbb{R}^n\)
- An almost cyclic 2-coordinate descent method for singly linearly constrained problems
- An efficient cutting plane algorithm for the smallest enclosing circle problem
Uses Software
This page was built for publication: Solution methodologies for the smallest enclosing circle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810982)
