Efficient algorithms for the smallest enclosing ball problem
type: Item
instance of: scholarly article
title: Efficient algorithms for the smallest enclosing ball problem
zbMATH Open document ID: 1112.90060
author: Guanglu Zhou
author: Kim-Chuan Toh
author: Jie Sun
published in: Computational Optimization and Applications
publication date: 2005-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 2168299
zbMATH Keywords: computational geometry
zbMATH Keywords: smoothing approximation
zbMATH Keywords: second order cone programming
describes a project that uses: Miniball
describes a project that uses: SDPT3
describes a project that uses: SeDuMi
describes a project that uses: LBFGS-B
describes a project that uses: LOQO
MaRDI profile type: Publication
full work available at URL: s10589-005-4565-7
OpenAlex ID: W2081315400
cites work: A Limited Memory Algorithm for Bound Constrained Optimization
cites work: The Minimum Covering Sphere Problem
cites work: Efficient Algorithms for the (Weighted) Minimum Circle Problem
cites work: An aggregate function method for nonlinear programming
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Q4324980
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Q3694703
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Solving semidefinite-quadratic-linear programs using SDPT3
cites work: LOQO user's manual — version 3.10
cites work: Solution methodologies for the smallest enclosing circle problem
cites work: An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
DOI: 10.1007/S10589-005-4565-7
description: scientific article; zbMATH DE number 2168299