Pages that link to "Item:Q2020607"
From MaRDI portal
The following pages link to Chebyshev center of the intersection of balls: complexity, relaxation and approximation (Q2020607):
Displaying 8 items.
- 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 (Q946350) (← links)
- An algorithm for finding the Chebyshev center of a convex polyhedron (Q1317311) (← links)
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension (Q2045012) (← links)
- Chebyshev center and inscribed balls: properties and calculations (Q2080823) (← links)
- Covering a set by a convex compactum: error estimates and computation (Q2090531) (← links)
- On Chebyshev Center of the Intersection of Two Ellipsoids (Q5214416) (← links)
- An algorithm for finding the generalized Chebyshev center of sets defined via their support functions (Q6638636) (← links)
- On global solvability of a class of possibly nonconvex QCQP problems in Hilbert spaces (Q6648843) (← links)
