摘要
本文基于两线性流形之间距离与公垂线性流形的定义,将求解两线性流形之间距离的问题转化为凸二次规划问题,结合全局最优性条件,给出了求解两线性流形之间距离的算法.通过实例,说明了该算法的可行性.
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.
出处
《漳州师范学院学报（自然科学版）》
2013年第2期11-17,共7页
Journal of ZhangZhou Teachers College（Natural Science)
关键词
线性流形
距离
二次规划
linear manifold
distance
quadratic program
