Chebyshev center and inscribed balls: properties and calculations
From MaRDI portal
Publication:2080823
DOI10.1007/s11590-021-01823-zzbMath1503.90156OpenAlexW3214042629MaRDI QIDQ2080823
Publication date: 11 October 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01823-z
linear programmingHausdorff distanceinscribed ballChebyshev centersupporting functionstability of minimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On polyhedral approximations in an \(n\)-dimensional space
- Uniform spherical grids via equal area projection from the cube to the sphere
- An algorithm for finding the Chebyshev center of a convex polyhedron
- Solution methodologies for the smallest enclosing circle problem
- Chebyshev center of the intersection of balls: complexity, relaxation and approximation
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- A new approximate algorithm for the Chebyshev center
- Strongly convex analysis
- Optimal algorithms theory for robust estimation and prediction
- LINEAR DIFFERENTIAL GAMES OF PURSUIT
- $ M$-strongly convex subsets and their generating sets
- A Minimax Chebyshev Estimator for Bounded Error Estimation
- Regularization in Regression with Bounded Noise: A Chebyshev Center Approach
- Set-Membership Error-in-Variables Identification Through Convex Relaxation Techniques
- Geometry. I, II. Transl. from the French by M. Cole and S. Levy
This page was built for publication: Chebyshev center and inscribed balls: properties and calculations
