首页> 外文会议>IEEE joint international computer science and information technology conference >Least-square Positive Semidefinite Explicit Solution of a Matrix Equation
【24h】

Least-square Positive Semidefinite Explicit Solution of a Matrix Equation

机译:矩阵方程的最小二乘正面半菲丁解自解决方案

获取原文

摘要

A nearness matrix is given with two constraints-least square constraint and symmetric positive semidefinite structure. It discusses problems: (1) the set γ of symmetric positive semidefinite real n×n matrices K to minimize the Frobenius norm of KX-F,where X, F are given matrices and (2) the element K in γ to minimize the Frobenius norm of C - K for any estimate matrix C. The conditions that γ is nonempty are given. An explicit form of elements in γ is provided and an explicit expression of the minimizer K is derived.
机译:近矩阵具有两个约束 - 最小二乘约束和对称正半纤维结构。它讨论了问题:(1)对称正半纤维实际N×N矩阵k的集合γ,以最小化KX-F的Frobenius规范,其中x,f是给出矩阵的(2)γ中的元素k以最小化Frobenius对于任何估计矩阵C的C-K标准。γ是毫空的条件。提供了γ中的明确形式的元素,并导出最小化器K的显式表达。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号