Efficient algorithms for the smallest enclosing ball problem
From MaRDI portal
Publication:1774576
DOI10.1007/s10589-005-4565-7zbMath1112.90060OpenAlexW2081315400MaRDI QIDQ1774576
Guanglu Zhou, Jie Sun, Kim-Chuan Toh
Publication date: 17 May 2005
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-005-4565-7
Convex programming (90C25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems ⋮ An efficient algorithm for the smallest enclosing ball problem in high dimensions ⋮ A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) ⋮ A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) ⋮ An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions ⋮ On the planar piecewise quadratic 1-center problem ⋮ A branch-and-bound method for the minimum \(k\)-enclosing ball problem ⋮ A reformulation-linearization based algorithm for the smallest enclosing circle problem ⋮ Optimal control of hybrid manufacturing systems by log-exponential smoothing aggregation ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\) ⋮ A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) ⋮ 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 ⋮ Minimal containment under homothetics: a simple cutting plane approach ⋮ Smoothing method for minimizing the sum of therlargest functions ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls ⋮ Solving \(k\)-center problems involving sets based on optimization techniques ⋮ An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- An aggregate function method for nonlinear programming
- Solution methodologies for the smallest enclosing circle problem
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- LOQO user's manual — version 3.10
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Limited Memory Algorithm for Bound Constrained Optimization
- The Minimum Covering Sphere Problem
