5×5半正定矩阵与5×5非负矩阵之间的最大角

IF 0.7 4区数学 Q2 Mathematics

Electronic Journal of Linear Algebra Pub Date : 2021-11-19 DOI:10.13001/ela.2021.6647

Qinghong Zhang

{"title":"5×5半正定矩阵与5×5非负矩阵之间的最大角","authors":"Qinghong Zhang","doi":"10.13001/ela.2021.6647","DOIUrl":null,"url":null,"abstract":"The paper is devoted to the study of the maximal angle between the $5\\times 5$ semidefinite matrix cone and $5\\times 5$ nonnegative matrix cone. A signomial geometric programming problem is formulated in the process to find the maximal angle. Instead of using an optimization problem solver to solve the problem numerically, the method of Lagrange Multipliers is used to solve the signomial geometric program, and therefore, to find the maximal angle between these two cones.","PeriodicalId":50540,"journal":{"name":"Electronic Journal of Linear Algebra","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2021-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The maximal angle between 5×5 positive semidefinite and 5×5 nonnegative matrices\",\"authors\":\"Qinghong Zhang\",\"doi\":\"10.13001/ela.2021.6647\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper is devoted to the study of the maximal angle between the $5\\\\times 5$ semidefinite matrix cone and $5\\\\times 5$ nonnegative matrix cone. A signomial geometric programming problem is formulated in the process to find the maximal angle. Instead of using an optimization problem solver to solve the problem numerically, the method of Lagrange Multipliers is used to solve the signomial geometric program, and therefore, to find the maximal angle between these two cones.\",\"PeriodicalId\":50540,\"journal\":{\"name\":\"Electronic Journal of Linear Algebra\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2021-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Linear Algebra\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.13001/ela.2021.6647\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Linear Algebra","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.13001/ela.2021.6647","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了半定矩阵锥与非负矩阵锥之间的最大夹角。在求最大角度的过程中，提出了一个多项式几何规划问题。使用拉格朗日乘子的方法来求解符号几何程序，从而找到这两个圆锥体之间的最大角度，而不是使用优化问题求解器来进行数值求解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The maximal angle between 5×5 positive semidefinite and 5×5 nonnegative matrices

The paper is devoted to the study of the maximal angle between the $5\times 5$ semidefinite matrix cone and $5\times 5$ nonnegative matrix cone. A signomial geometric programming problem is formulated in the process to find the maximal angle. Instead of using an optimization problem solver to solve the problem numerically, the method of Lagrange Multipliers is used to solve the signomial geometric program, and therefore, to find the maximal angle between these two cones.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Electronic Journal of Linear Algebra 数学-数学

CiteScore

1.20

自引率

14.30%

发文量

审稿时长

6-12 weeks

期刊介绍： The journal is essentially unlimited by size. Therefore, we have no restrictions on length of articles. Articles are submitted electronically. Refereeing of articles is conventional and of high standards. Posting of articles is immediate following acceptance, processing and final production approval.