Approximate calculation of the Chebyshev center for a convex compact set in R^n
From MaRDI portal
Publication:3391378
Recommendations
Cites work
- A new approximate algorithm for the Chebyshev center
- An algorithm for finding the Chebyshev center of a convex polyhedron
- Elements of convex and strongly convex analysis
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
- scientific article; zbMATH DE number 3224969 (Why is no real title available?)
- LINEAR DIFFERENTIAL GAMES OF PURSUIT
- On polyhedral approximations in an n-dimensional space
- Optimal algorithms theory for robust estimation and prediction
- Polyhedral approximations of strictly convex compacta
- Set-Membership Error-in-Variables Identification Through Convex Relaxation Techniques
- Solution methodologies for the smallest enclosing circle problem
Cited in
(9)- Chebyshev center and inscribed balls: properties and calculations
- Covering a set by a convex compactum: error estimates and computation
- A new approximate algorithm for the Chebyshev center
- Applications of Chebyshev polynomials to low-dimensional computational geometry
- Applications of Chebyshev polynomials to low-dimensional computational geometry
- Embedding of a homothete in a convex compactum: an algorithm and its convergence
- Attaining the Chebyshev bound for optimal learning: a numerical algorithm
- scientific article; zbMATH DE number 7685237 (Why is no real title available?)
- An algorithm for finding the generalized Chebyshev center of sets defined via their support functions
This page was built for publication: Approximate calculation of the Chebyshev center for a convex compact set in \(\mathbb{R}^n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391378)
