...
首页> 外文期刊>Numerical algorithms >The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems
【24h】

The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems

机译:基于模量的矩阵分割迭代方法,用于二阶锥线性互补问题

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

摘要

For the second-order cone linear complementarity problems, abbreviated as SOCLCPs, we establish two classes of modulus-based matrix splitting iteration methods, which are obtained by reformulating equivalently the SOCLCP as an implicit fixed-point equation based on Jordan algebra associated with the second-order cone. The convergence of these modulus-based matrix splitting iteration methods has been established and the optimal iteration parameters of these methods are discussed when the splitting matrix is symmetric positive definite. Numerical experiments have shown that the modulus-based iteration methods are effective for solving the SOCLCPs.
机译:对于二阶锥形线性互补问题,缩写为SOCLCP,我们建立了两类基于模数的基于模数的矩阵拆分方法,该矩阵拆分方法是基于与第二个相关联的JORDAN代数的隐式定点方程来重新绘制SOCLCP而获得的基于模数基矩阵拆分方法。 - 锥体。 已经建立了基于模量的矩阵分割迭代方法的收敛性,并且当分割矩阵是对称的正明确定时,讨论了这些方法的最佳迭代参数。 数值实验表明,模量的迭代方法对于求解SOCLCP是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号