Covering a set by a convex compactum: error estimates and computation
From MaRDI portal
Publication:2090531
DOI10.1134/S0001434622090024zbMath1505.90141MaRDI QIDQ2090531
Publication date: 25 October 2022
Published in: Mathematical Notes (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On polyhedral approximations in an \(n\)-dimensional space
- Polyhedral approximations of strictly convex compacta
- Uniform spherical grids via equal area projection from the cube to the sphere
- Geometry of Banach spaces. Selected topics
- 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
- Systematization of problems on ball estimates of a convex compactum
- Optimal algorithms theory for robust estimation and prediction
- $ M$-strongly convex subsets and their generating sets
- Geometric Approximation Theory
- The External Estimate of the Compact Set by Lebesgue Set of the Convex Function
- Chebyshev centres, Jung constants, and their applications
- Regularization in Regression with Bounded Noise: A Chebyshev Center Approach
- Set-Membership Error-in-Variables Identification Through Convex Relaxation Techniques
- On the stability of inner and outer approximations of a convex compact set by a ball
This page was built for publication: Covering a set by a convex compactum: error estimates and computation
