Efficient algorithms for the smallest enclosing ball problem
From MaRDI portal
Recommendations
Cites work
- A Limited Memory Algorithm for Bound Constrained Optimization
- An aggregate function method for nonlinear programming
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- LOQO user's manual — version 3.10
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Solution methodologies for the smallest enclosing circle problem
- Solving semidefinite-quadratic-linear programs using SDPT3
- The Minimum Covering Sphere Problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(35)- On the ball spanned by balls
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem
- Optimal control of hybrid manufacturing systems by log-exponential smoothing aggregation
- Solving \(k\)-center problems involving sets based on optimization techniques
- Complexity and approximation of the smallest \(k\)-enclosing ball problem
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- On the planar piecewise quadratic 1-center problem
- 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
- A hybrid algorithm for the minimum bounding sphere problem
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
- A limited memory BFGS algorithm for the smallest enclosing ball problem
- Efficient algorithms to decide tightness
- Two Algorithms for the Minimum Enclosing Ball Problem
- Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- scientific article; zbMATH DE number 1985309 (Why is no real title available?)
- On the elimination of inessential points in the smallest enclosing ball problem
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
- An inexact augmented Lagrangian method for second-order cone programming with applications
- Minimal containment under homothetics: a simple cutting plane approach
- The smallest enclosing ball of balls: combinatorial structure and algorithms
- A smoothing algorithm for smallest enclosing ball problems based on limited memory BFGS method
- Smoothing method for minimizing the sum of therlargest functions
- Algorithms - ESA 2003
- Algorithms - ESA 2003
- Computational Science and Its Applications – ICCSA 2004
- 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 faster dual algorithm for the Euclidean minimum covering ball problem
- A dual algorithm for the minimum covering 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
This page was built for publication: Efficient algorithms for the smallest enclosing ball problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774576)
