...
首页> 外文期刊>SIAM Journal on Scientific Computing >Quasi-Newton methods on Grassmannians and multilinear approximations of tensors
【24h】

Quasi-Newton methods on Grassmannians and multilinear approximations of tensors

机译:Grassmannian上的拟牛顿法和张量的多线性逼近

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defined BFGS and limited memory BFGS updates in local and global coordinates on Grassmannians or a product of these. We proved that, when local coordinates are used, our BFGS updates on Grassmannians share the same optimality property as the usual BFGS updates on Euclidean spaces. When applied to the best multilinear rank approximation problem for general and symmetric tensors, our approach yields fast, robust, and accurate algorithms that exploit the special Grassmannian structure of the respective problems and which work on tensors of large dimensions and arbitrarily high order. Extensive numerical experiments are included to substantiate our claims.
机译:在本文中,我们针对格拉斯曼函数或格拉斯曼函数的乘积定义了目标函数,提出了拟牛顿法和有限记忆拟牛顿法。具体来说,我们定义了BFGS和有限内存的BFGS更新,它们在Grassmannian或它们的乘积上的局部和全局坐标中进行。我们证明,当使用局部坐标时,我们在Grassmannians上的BFGS更新与在欧几里得空间上的常规BFGS更新具有相同的最优性。当将其应用于一般张量和对称张量的最佳多线性秩逼近问题时,我们的方法会得出快速,鲁棒和准确的算法,这些算法利用各个问题的特殊Grassmannian结构,并能处理大尺寸和任意高阶张量。包括大量的数值实验,以证实我们的主张。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号