On computing sparse generalized inverses

IF 0.8 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Operations Research Letters Pub Date : 2023-12-15 DOI:10.1016/j.orl.2023.107058
Gabriel Ponte , Marcia Fampa , Jon Lee , Luze Xu
{"title":"On computing sparse generalized inverses","authors":"Gabriel Ponte ,&nbsp;Marcia Fampa ,&nbsp;Jon Lee ,&nbsp;Luze Xu","doi":"10.1016/j.orl.2023.107058","DOIUrl":null,"url":null,"abstract":"<div><p>The M-P (Moore-Penrose) pseudoinverse is used in several linear-algebra applications. It is convenient to construct sparse block-structured matrices satisfying some relevant properties of the M-P pseudoinverse for specific applications. Aiming at row-sparse generalized inverses, we consider 2,1-norm minimization (and generalizations). We show that a 2,1-norm minimizing generalized inverse satisfies two additional M-P properties, including one needed for computing least-squares solutions. We present formulations related to finding row-sparse generalized inverses that can be solved very efficiently, which we verify numerically.</p></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2023-12-15","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/S0167637723001992","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The M-P (Moore-Penrose) pseudoinverse is used in several linear-algebra applications. It is convenient to construct sparse block-structured matrices satisfying some relevant properties of the M-P pseudoinverse for specific applications. Aiming at row-sparse generalized inverses, we consider 2,1-norm minimization (and generalizations). We show that a 2,1-norm minimizing generalized inverse satisfies two additional M-P properties, including one needed for computing least-squares solutions. We present formulations related to finding row-sparse generalized inverses that can be solved very efficiently, which we verify numerically.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于计算稀疏广义倒数
M-P(摩尔-彭罗斯)伪逆用于若干线性代数应用中。在特定应用中,构建满足 M-P 伪逆的某些相关性质的稀疏块结构矩阵非常方便。针对行稀疏广义逆,我们考虑了 2,1-norm 最小化(和广义)。我们证明,2,1-规范最小化广义逆满足两个额外的 M-P 特性,包括计算最小二乘法解所需的一个特性。我们提出了与寻找行稀疏广义逆相关的公式,这些公式可以非常高效地求解,我们也对其进行了数值验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Operations Research Letters
Operations Research Letters 管理科学-运筹学与管理科学
CiteScore
2.10
自引率
9.10%
发文量
111
审稿时长
83 days
期刊介绍: 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.
期刊最新文献
Break maximization for round-robin tournaments without consecutive breaks Anchored rescheduling problem with non-availability periods The circle packing problem: A theoretical comparison of various convexification techniques Structured pruning of neural networks for constraints learning Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1