@inproceedings{3c07f7f64bcb42c59d6a12799efcbd43,
title = "On Chebyshev Center of the Intersection of Two Ellipsoids",
abstract = "We study the problem of finding the smallest ball covering the intersection of two ellipsoids, which is also known as the Chebyshev center problem (CC). Semidefinite programming (SDP) relaxation is an efficient approach to approximate (CC). In this paper, we first establish the worst-case approximation bound of (SDP). Then we show that (CC) can be globally solved in polynomial time. As a by-product, one can randomly generate Celis-Dennis-Tapia subproblems having positive Lagrangian duality gap with high probability.",
keywords = "Approximation bound, CDT subproblem, Chebyshev center, Polynomial solvability, Semidefinite programming",
author = "Xiaoli Cen and Yong Xia and Runxuan Gao and Tianzhi Yang",
note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 6th World Congress on Global Optimization, WCGO 2019 ; Conference date: 08-07-2019 Through 10-07-2019",
year = "2020",
doi = "10.1007/978-3-030-21803-4\_14",
language = "英语",
isbn = "9783030218027",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer Verlag",
pages = "135--144",
editor = "\{Le Thi\}, \{Hoai An\} and Le, \{Hoai Minh\} and \{Pham Dinh\}, Tao",
booktitle = "Optimization of Complex Systems",
address = "德国",
}