首页> 外文期刊>Computational Optimization and Applications >A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem
【24h】

A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem

机译:解决对称特征值互补问题的直流编程方法

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

摘要

In this paper, we investigate a DC (Difference of Convex functions) programming technique for solving large scale Eigenvalue Complementarity Problems (EiCP) with real symmetric matrices. Three equivalent formulations of EiCP are considered. We first reformulate them as DC programs and then use DCA (DC Algorithm) for their solution. Computational results show the robustness, efficiency, and high speed of the proposed algorithms.
机译:在本文中,我们研究了使用实对称矩阵求解大规模特征值互补问题(EiCP)的DC(凸函数差)编程技术。考虑了三种等效的EiCP公式。我们首先将它们重新格式化为DC程序,然后将DCA(DC算法)用于其解决方案。计算结果表明了所提算法的鲁棒性,效率和高速性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号