Chebyshev center of the intersection of balls: complexity, relaxation and approximation
From MaRDI portal
Publication:2020607
DOI10.1007/s10107-020-01479-0zbMath1465.90120arXiv1901.07645OpenAlexW3008356049MaRDI QIDQ2020607
Shu Wang, Yong Xia, Mei-Jia Yang
Publication date: 23 April 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.07645
complexityminimaxlinear programmingsemidefinite programmingapproximationstrong dualityChebyshev centernonconvex quadratic optimization
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (4)
Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension ⋮ On Chebyshev Center of the Intersection of Two Ellipsoids ⋮ Chebyshev center and inscribed balls: properties and calculations ⋮ Covering a set by a convex compactum: error estimates and computation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
- Introductory lectures on convex optimization. A basic course.
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints
- A new approximate algorithm for the Chebyshev center
- 10.1007/s11470-008-1002-x
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Optimal algorithms theory for robust estimation and prediction
- Convergence of the method of Chebyshev centers and some applications
- The minimum sphere covering a convex polyhedron
- Linear Matrix Inequalities in System and Control Theory
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- A Minimax Chebyshev Estimator for Bounded Error Estimation
- Semidefinite Programming
- On Chebyshev Center of the Intersection of Two Ellipsoids
- Regularization in Regression with Bounded Noise: A Chebyshev Center Approach
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- LMI approximations for the radius of the intersection of ellipsoids: Survey.
This page was built for publication: Chebyshev center of the intersection of balls: complexity, relaxation and approximation
