期刊
APPLIED MATHEMATICS LETTERS
卷 23, 期 8, 页码 912-916出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.aml.2010.04.009
关键词
Computational geometry; Basic semi-algebraic sets; Convexity; Semidefinite programming
资金
- (French) ANR [NT05-3-41612]
We provide two certificates of convexity for arbitrary basic closed semi-algebraic sets of R(n). The first one is based on a necessary and sufficient condition whereas the second one is based on a sufficient (but simpler) condition only. Both certificates are obtained from any feasible solution of a related semidefinite program and so, in principle, can be obtained numerically (however, up to machine precision). (c) 2010 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据