Method for Computing Distance the Between Point and Convex Set

被引：0

作者：

Yong Longquan ^{[1
]}

机构：

[1] Shaanxi Univ Technol, Dept Math, Hanzhong 723001, Peoples R China

来源：

PROCEEDINGS OF THE 2010 INTERNATIONAL CONFERENCE ON APPLICATION OF MATHEMATICS AND PHYSICS, VOL 2: ADVANCES ON APPLIED MATHEMATICS AND COMPUTATION MATHEMATICS | 2010年

关键词：

distance problem; convex set; representation theoerom; convex quadratic programming; MATLAB software;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We consider the distance problem between the given point and nonempty bounded convex set. By using representation theoerom of convex polyhedron, we transform the distance problem into convex quadratic programming model and solving convex quadratic programming problem by MATLAB software. Computation results demonstrate our method is effective.

引用

页码：199 / 203

页数：5

共 50 条

[31] Technical efficiency and distance to a reverse convex set
Briec, W
Lemaire, B
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 114 (01) : 178 - 187
[32] COMPUTING THE CONVEX-HULL OF A SET OF POINTS
ALLISON, DCS
NOGA, MT
COMPUTER PHYSICS COMMUNICATIONS, 1987, 43 (03) : 381 - 386
[33] ON COMPUTING THE CENTER OF A CONVEX QUADRATICALLY CONSTRAINED SET
MEHROTRA, S
SUN, J
MATHEMATICAL PROGRAMMING, 1991, 50 (01) : 81 - 89
[34] Fast Approach for Computing the Minimum Distance between a Point and a NURBS Curve
Wang L.
Chen X.
Chen L.
Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2019, 31 (01): : 26 - 30
[35] THE ACCURATE COMPUTING OF CLOTHOID COORDINATE VALUES AND OF THE DISTANCE BETWEEN A POINT AND A CLOTHOID
Ursu-Fischer, Nicolae
Popescu, Diana Ioana
Moholea, Iuliana Fabiola
ACTA TECHNICA NAPOCENSIS SERIES-APPLIED MATHEMATICS MECHANICS AND ENGINEERING, 2021, 64 (02): : 207 - 218
[36] Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
Hideaki Iiduka
Mathematical Programming, 2015, 149 : 131 - 165
[37] Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
Iiduka, Hideaki
MATHEMATICAL PROGRAMMING, 2015, 149 (1-2) : 131 - 165
[38] AN OPTIMAL ALGORITHM FOR COMPUTING THE MINIMUM VERTEX DISTANCE BETWEEN 2 CROSSING CONVEX POLYGONS
TOUSSAINT, GT
COMPUTING, 1984, 32 (04) : 357 - 364
[39] Algorithm research for computing the minimum distance between two convex polyhedra in collision detection
Jin, Hanjun
Li, Zhaohui
Wang, Yanlin
Wang, Qiong
Wuhan Ligong Daxue Xuebao (Jiaotong Kexue Yu Gongcheng Ban)/Journal of Wuhan University of Technology (Transportation Science and Engineering), 2006, 30 (02): : 300 - 302
[40] On the Distance between Convex Bodies
国起
NortheasternMathematicalJournal, 1999, (03) : 323 - 331

← 1 2 3 4 5 →