...
首页> 外文期刊>Computational optimization and applications >SDP relaxation algorithms for P(P0)documentclass[12pt]{minimal}usepackage{amsmath}usepackage{wasysym}usepackage{amsfonts}usepackage{amssymb}usepackage{amsbsy}usepackage{mathrsfs}usepackage{upgreek}setlength{oddsidemargin}{-69pt}egin{document}$$mathbf {P}(mathbf {P}_0)$$end{document}-tensor detection
【24h】

SDP relaxation algorithms for P(P0)documentclass[12pt]{minimal}usepackage{amsmath}usepackage{wasysym}usepackage{amsfonts}usepackage{amssymb}usepackage{amsbsy}usepackage{mathrsfs}usepackage{upgreek}setlength{oddsidemargin}{-69pt}egin{document}$$mathbf {P}(mathbf {P}_0)$$end{document}-tensor detection

机译:P(P0) DocumentClass [12pt]的SDP弛豫算法{MIMIMAL} usepackage {ammath} usepackage {kyysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} { - 69pt} begin {document} $$ mathbf {p}( mathbf {p} _0)$$ end {document} -tensor检测

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

摘要

Pdocumentclass[12pt]{minimal}usepackage{amsmath}usepackage{wasysym}usepackage{amsfonts}usepackage{amssymb}usepackage{amsbsy}usepackage{mathrsfs}usepackage{upgreek}setlength{oddsidemargin}{-69pt}egin{document}$$mathbf {P}$$end{document}-tensor and P0documentclass[12pt]{minimal}usepackage{amsmath}usepackage{wasysym}usepackage{amsfonts}usepackage{amssymb}usepackage{amsbsy}usepackage{mathrsfs}usepackage{upgreek}setlength{oddsidemargin}{-69pt}egin{document}$$mathbf {P}_0$$end{document}-tensor are introduced in tensor complementarity problem, which have wide applications in game theory. In this paper, we establish SDP relaxation algorithms for detecting P(P0)documentclass[12pt]{minimal}usepackage{amsmath}usepackage{wasysym}usepackage{amsfonts}usepackage{amssymb}usepackage{amsbsy}usepackage{mathrsfs}usepackage{upgreek}setlength{oddsidemargin}{-69pt}egin{document}$$mathbf {P}(mathbf {P}_0)$$end{document}-tensor. We first reformulate P(P0)documentclass[12pt]{minimal}usepackage{amsmath}usepackage{wasysym}usepackage{amsfonts}usepackage{amssymb}usepackage{amsbsy}usepackage{mathrsfs}usepackage{upgreek}setlength{oddsidemargin}{-69pt}egin{document}$$mathbf {P}(mathbf {P}_0)$$end{document}-tensor detection problem as polynomial optimization problems. Then we propose the SDP relaxation algorithms for solving the reformulated polynomial optimization problems. Numerical examples are reported to show the efficiency of the proposed algorithms.
机译:p documentclass [12pt] {minimal} usepackage {ammath} usepackage {kyysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} { - 69pt} begin {document} $$ mathbf {p} $$ end {document} -tensor和p0 documentclass [12pt] {minimal} usepackage {ammath} usepackage {kyysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} { - 69pt} begin {document} $$ mathbf {p} _0 $$$$$$$$$ {Document} -tensor在Tensor互补问题中引入,在博弈论中具有广泛的应用。在本文中,我们建立了检测P(P0) DocumentClass [12pt]的SDP弛豫算法[12pt] {minimal} usepackage {ammath} usepackage {kyysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} { - 69pt} begin {document} $$ mathbf {p}( mathbf {p} _0)$$ end {document} -tensor。我们首先重新重整P(P0) DocumentClass [12pt] {minimal} usepackage {ammath} usepackage {kyysym} usepackage {amsfonts} usepackage {amssymb} usepackage {amsbsy} usepackage {mathrsfs} usepackage {supmeek} setLength { oddsidemargin} { - 69pt} begin {document} $$ mathbf {p}( mathbf {p} _0)$$ end {document} -tensor检测问题作为多项式优化问题。然后我们提出了用于解决重新改造的多项式优化问题的SDP弛豫算法。据报道,据报道数值示例显示所提出的算法的效率。

著录项

相似文献

  • 外文文献
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号