An efficient algorithm for the smallest enclosing ball problem in high dimensions
From MaRDI portal
Publication:2369067
DOI10.1016/j.amc.2005.01.127zbMath1090.65076MaRDI QIDQ2369067
Publication date: 28 April 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.01.127
algorithms; convergence; convex optimization; numerical examples; smooth approximation; smallest enclosing ball; nondifferentiable problem
Related Items
A smoothing trust-region Newton-CG method for minimax problem, An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An aggregate function method for nonlinear programming
- Efficient algorithms for the smallest enclosing ball problem
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- An efficient, exact, and generic quadratic programming solver for geometric optimization
- The Minimum Covering Sphere Problem
- Algorithms - ESA 2003