KMS Of Academy of mathematics and systems sciences, CAS
Chebyshev center of the intersection of balls: complexity, relaxation and approximation | |
Xia, Yong1; Yang, Meijia1; Wang, Shu2 | |
2020-02-17 | |
Source Publication | MATHEMATICAL PROGRAMMING |
ISSN | 0025-5610 |
Pages | 29 |
Abstract | We study the n-dimensional problem of finding the smallest ball enclosing the intersection of p given balls, the so-called Chebyshev center problem (CCB). It is a minimax optimization problem and the inner maximization is a uniform quadratic optimization problem (UQ). When p = n, (UQ) is known to enjoy a strong duality and consequently (CCB) is solved via a standard convex quadratic programming (SQP). In this paper, we first prove that (CCB) is NP-hard and the special case when n = 2 is polynomially solvable. With the help of a newly introduced linear programming relaxation (LP), the (SQP) relaxation is reobtained more directly and the first approximation bound for the solution obtained by (SQP) is established for the hard case p > n. Finally, also based on (LP), we showthat (CCB) is polynomially solvablewhen either n or p-n(> 0) is fixed. |
Keyword | Chebyshev center Minimax Nonconvex quadratic optimization Semidefinite programming Strong duality Linear programming Approximation Complexity |
DOI | 10.1007/s10107-020-01479-0 |
Indexed By | SCI |
Language | 英语 |
Funding Project | National Science Fund for Excellent Young Scholars[11822103] ; National Natural Science Foundation of China[11801173] ; National Natural Science Foundation of China[11571029] ; National Natural Science Foundation of China[11771056] ; Beijing Natural Science Foundation[Z180005] |
WOS Research Area | Computer Science ; Operations Research & Management Science ; Mathematics |
WOS Subject | Computer Science, Software Engineering ; Operations Research & Management Science ; Mathematics, Applied |
WOS ID | WOS:000516414600002 |
Publisher | SPRINGER HEIDELBERG |
Citation statistics | |
Document Type | 期刊论文 |
Identifier | http://ir.amss.ac.cn/handle/2S8OKBNM/50890 |
Collection | 中国科学院数学与系统科学研究院 |
Corresponding Author | Wang, Shu |
Affiliation | 1.Beihang Univ, Sch Math & Syst Sci, Minist Educ, LMIB, Beijing 100191, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Computat Math & Sci Engn Comp, State Key Lab Sci & Engn Comp, Beijing 100190, Peoples R China |
Recommended Citation GB/T 7714 | Xia, Yong,Yang, Meijia,Wang, Shu. Chebyshev center of the intersection of balls: complexity, relaxation and approximation[J]. MATHEMATICAL PROGRAMMING,2020:29. |
APA | Xia, Yong,Yang, Meijia,&Wang, Shu.(2020).Chebyshev center of the intersection of balls: complexity, relaxation and approximation.MATHEMATICAL PROGRAMMING,29. |
MLA | Xia, Yong,et al."Chebyshev center of the intersection of balls: complexity, relaxation and approximation".MATHEMATICAL PROGRAMMING (2020):29. |
Files in This Item: | ||||||
There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment