{"title":"Q张量元组到多项式互补问题","authors":"Tongtong Shang , Wensheng Jia","doi":"10.1016/j.orl.2025.107297","DOIUrl":null,"url":null,"abstract":"<div><div>The goal of this paper is to introduce a new class of structured tensor tuples, called <em>Q</em>-tensor tuple, which is associated with the solution of polynomial complementarity problems. Some characterizations of <em>Q</em>-tensor tuple are discussed. Furthermore, the uniqueness of the solution to the corresponding polynomial complementarity problems is investigated with a nonnegative <em>Q</em>-tensor tuple. A sufficient condition is given for the nonzero solution of the corresponding polynomial complementarity problem containing at least two nonzero components.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"61 ","pages":"Article 107297"},"PeriodicalIF":0.9000,"publicationDate":"2025-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Q tensor tuples to polynomial complementarity problems\",\"authors\":\"Tongtong Shang , Wensheng Jia\",\"doi\":\"10.1016/j.orl.2025.107297\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The goal of this paper is to introduce a new class of structured tensor tuples, called <em>Q</em>-tensor tuple, which is associated with the solution of polynomial complementarity problems. Some characterizations of <em>Q</em>-tensor tuple are discussed. Furthermore, the uniqueness of the solution to the corresponding polynomial complementarity problems is investigated with a nonnegative <em>Q</em>-tensor tuple. A sufficient condition is given for the nonzero solution of the corresponding polynomial complementarity problem containing at least two nonzero components.</div></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"61 \",\"pages\":\"Article 107297\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2025-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637725000586\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637725000586","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
Q tensor tuples to polynomial complementarity problems
The goal of this paper is to introduce a new class of structured tensor tuples, called Q-tensor tuple, which is associated with the solution of polynomial complementarity problems. Some characterizations of Q-tensor tuple are discussed. Furthermore, the uniqueness of the solution to the corresponding polynomial complementarity problems is investigated with a nonnegative Q-tensor tuple. A sufficient condition is given for the nonzero solution of the corresponding polynomial complementarity problem containing at least two nonzero components.
期刊介绍:
Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.