Solution methodologies for the smallest enclosing circle problem

DOI10.1023/A:1022977709811MaRDI QIDQ1810982zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

computational geometryoptimization

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonlinear programming (90C30)

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

Cited in

(27)

• Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
• Efficient algorithms for the smallest enclosing ball problem
• Chebyshev center and inscribed balls: properties and calculations
• Covering a set by a convex compactum: error estimates and computation
• An efficient cutting plane algorithm for the smallest enclosing circle problem
• On the geometry of the smallest circle enclosing a finite set of points
• An almost cyclic 2-coordinate descent method for singly linearly constrained problems
• A new approximate algorithm for the Chebyshev center
• The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
• A reformulation-linearization based algorithm for the smallest enclosing circle problem
• An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
• On a sequential linear programming approach to finding the smallest circumscribed, largest inscribed, and minimum zone circle or sphere
• Approximations of differentiable convex functions on arbitrary convex polytopes
• Approximate calculation of the Chebyshev center for a convex compact set in \(\mathbb{R}^n\)
• An adaptive perturbation-based heuristic: an application to the continuous p-centre problem
• A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints
• The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• Efficient Speed-Up of the Smallest Enclosing Circle Algorithm
• Chebyshev centres, Jung constants, and their applications
• Approximate minimum enclosing balls in high dimensions using core-sets
• The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
• A fast solver for the narrow capture and narrow escape problems in the sphere
• Distributionally robust learning for multisource unsupervised domain adaptation
• An active-set algorithmic framework for non-convex optimization problems over the simplex
• 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

Describes a project that uses

Uses Software

• SeDuMi

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)