基于二次规划的求两线性流形之间距离的一种算法  

An Algorithm Based on the Quadratic Programming for Distance between Two Linear Manifolds

作　　者：何金花[1] 张圣贵[2] 

机构地区：[1]福建师范大学协和学院,福建福州350108 [2]福建师范大学数学与计算机科学学院,福建福州350108

出　　处：《漳州师范学院学报（自然科学版）》2013年第2期11-17,共7页Journal of ZhangZhou Teachers College（Natural Science)

摘　　要：本文基于两线性流形之间距离与公垂线性流形的定义,将求解两线性流形之间距离的问题转化为凸二次规划问题,结合全局最优性条件,给出了求解两线性流形之间距离的算法.通过实例,说明了该算法的可行性.Based on the distance between two linear manifolds and the definition of common perpendicular manifold,this article characterizes the distance between two linear manifolds by a convex quadratic program and gives its algorithm by optimal conditions.And we illustrate the feasibility of the proposed algorithm through example.

关 键 词：线性流形 距离 二次规划 

分 类 号：O221[理学—运筹学与控制论]