CSpace
Chebyshev center of the intersection of balls: complexity, relaxation and approximation
Xia, Yong1; Yang, Meijia1; Wang, Shu2
2020-02-17
发表期刊MATHEMATICAL PROGRAMMING
ISSN0025-5610
页码29
摘要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.
关键词Chebyshev center Minimax Nonconvex quadratic optimization Semidefinite programming Strong duality Linear programming Approximation Complexity
DOI10.1007/s10107-020-01479-0
收录类别SCI
语种英语
资助项目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研究方向Computer Science ; Operations Research & Management Science ; Mathematics
WOS类目Computer Science, Software Engineering ; Operations Research & Management Science ; Mathematics, Applied
WOS记录号WOS:000516414600002
出版者SPRINGER HEIDELBERG
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/50890
专题中国科学院数学与系统科学研究院
通讯作者Wang, Shu
作者单位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
推荐引用方式
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.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Xia, Yong]的文章
[Yang, Meijia]的文章
[Wang, Shu]的文章
百度学术
百度学术中相似的文章
[Xia, Yong]的文章
[Yang, Meijia]的文章
[Wang, Shu]的文章
必应学术
必应学术中相似的文章
[Xia, Yong]的文章
[Yang, Meijia]的文章
[Wang, Shu]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。