Geometric programming for multilinear systems with nonsingular [formula omitted]-tensors

IF 2.9 2区 数学 Q1 MATHEMATICS, APPLIED
Haibin Chen, Guanglu Zhou, Hong Yan
{"title":"Geometric programming for multilinear systems with nonsingular [formula omitted]-tensors","authors":"Haibin Chen, Guanglu Zhou, Hong Yan","doi":"10.1016/j.aml.2025.109462","DOIUrl":null,"url":null,"abstract":"We consider multilinear systems which arise in various applications, such as data mining and numerical differential equations. In this paper, we show that the multilinear system with a nonsingular <mml:math altimg=\"si2.svg\" display=\"inline\"><mml:mi mathvariant=\"script\">M</mml:mi></mml:math>-tensor can be formulated equivalently into a geometric programming (GP) problem which can be solved by the barrier-based interior point method with a worst-case polynomial-time complexity. To the best of our knowledge, there is not a complexity analysis for the existing algorithms of the multilinear systems. Numerical results are reported to show the efficiency of the proposed GP method.","PeriodicalId":55497,"journal":{"name":"Applied Mathematics Letters","volume":"122 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics Letters","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1016/j.aml.2025.109462","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We consider multilinear systems which arise in various applications, such as data mining and numerical differential equations. In this paper, we show that the multilinear system with a nonsingular M-tensor can be formulated equivalently into a geometric programming (GP) problem which can be solved by the barrier-based interior point method with a worst-case polynomial-time complexity. To the best of our knowledge, there is not a complexity analysis for the existing algorithms of the multilinear systems. Numerical results are reported to show the efficiency of the proposed GP method.
具有非奇异张量的多线性系统的几何规划
我们考虑了在数据挖掘和数值微分方程等各种应用中出现的多线性系统。在本文中,我们展示了具有非正弦 M 张量的多线性系统可以等价地表述为一个几何程序设计(GP)问题,该问题可以通过基于障碍的内点法求解,并具有最坏情况下的多项式时间复杂度。据我们所知,现有的多线性系统算法还没有复杂度分析。报告的数值结果表明了所提出的 GP 方法的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Mathematics Letters
Applied Mathematics Letters 数学-应用数学
CiteScore
7.70
自引率
5.40%
发文量
347
审稿时长
10 days
期刊介绍: The purpose of Applied Mathematics Letters is to provide a means of rapid publication for important but brief applied mathematical papers. The brief descriptions of any work involving a novel application or utilization of mathematics, or a development in the methodology of applied mathematics is a potential contribution for this journal. This journal''s focus is on applied mathematics topics based on differential equations and linear algebra. Priority will be given to submissions that are likely to appeal to a wide audience.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信