Solution methodologies for the smallest enclosing circle problem
From MaRDI portal
Publication:1810982
DOI10.1023/A:1022977709811zbMath1038.90080OpenAlexW2171409252MaRDI QIDQ1810982
Jie Sun, Sheng Xu, Robert M. Freund
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
Nonlinear programming (90C30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (25)
An efficient cutting plane algorithm for the smallest enclosing circle problem ⋮ Approximations of differentiable convex functions on arbitrary convex polytopes ⋮ Efficient Speed-Up of the Smallest Enclosing Circle Algorithm ⋮ 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 ⋮ On the geometry of the smallest circle enclosing a finite set of points ⋮ An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem ⋮ THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS ⋮ A reformulation-linearization based algorithm for the smallest enclosing circle problem ⋮ An almost cyclic 2-coordinate descent method for singly linearly constrained problems ⋮ An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization ⋮ 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 ⋮ Unnamed Item ⋮ 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 ⋮ 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 ⋮ Efficient algorithms for the smallest enclosing ball problem ⋮ Approximate minimum enclosing balls in high dimensions using core-sets ⋮ Chebyshev centres, Jung constants, and their applications ⋮ Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming ⋮ Chebyshev center and inscribed balls: properties and calculations ⋮ An active-set algorithmic framework for non-convex optimization problems over the simplex ⋮ Covering a set by a convex compactum: error estimates and computation
Uses Software
This page was built for publication: Solution methodologies for the smallest enclosing circle problem
