Enhanced optimization of high order concentrated matrix-exponential distributions

IF 0.3 Q4 MATHEMATICS
S. Almousa, M. Telek
{"title":"Enhanced optimization of high order concentrated matrix-exponential distributions","authors":"S. Almousa, M. Telek","doi":"10.33039/AMI.2021.02.001","DOIUrl":null,"url":null,"abstract":"This paper presents numerical methods for finding high order concentrated matrix-exponential (ME) distributions, whose squared coefficient of variation (SCV) is very low. Due to the absence of symbolic construction to obtain the most concentrated ME distributions, non-linear optimization problems are defined to obtain high order concentrated matrix-exponential (CME) distributions . The number of parameters to optimize increases with the order in the “full” version of the optimization problem. For orders, where “full” optimization is infeasible (n > 184), a “heuristic” optimization procedure, optimizing only 3 parameters independent of the order, was proposed in [6]. In this work we present an enhanced version of this heuristic optimization procedure, optimizing only 6 parameters independent of the order, which results in CME distributions with lower SCV than the existing 3-parameter method. The SCV gain of the new procedure compared to the old one is ∗This work is partially supported by the OTKA K-123914 and the NKFIH BME NC TKP2020 projects. Annales Mathematicae et Informaticae 53 (2021) pp. 5–19 doi: https://doi.org/10.33039/ami.2021.02.001 url: https://ami.uni-eszterhazy.hu","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":null,"pages":null},"PeriodicalIF":0.3000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annales Mathematicae et Informaticae","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.33039/AMI.2021.02.001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

Abstract

This paper presents numerical methods for finding high order concentrated matrix-exponential (ME) distributions, whose squared coefficient of variation (SCV) is very low. Due to the absence of symbolic construction to obtain the most concentrated ME distributions, non-linear optimization problems are defined to obtain high order concentrated matrix-exponential (CME) distributions . The number of parameters to optimize increases with the order in the “full” version of the optimization problem. For orders, where “full” optimization is infeasible (n > 184), a “heuristic” optimization procedure, optimizing only 3 parameters independent of the order, was proposed in [6]. In this work we present an enhanced version of this heuristic optimization procedure, optimizing only 6 parameters independent of the order, which results in CME distributions with lower SCV than the existing 3-parameter method. The SCV gain of the new procedure compared to the old one is ∗This work is partially supported by the OTKA K-123914 and the NKFIH BME NC TKP2020 projects. Annales Mathematicae et Informaticae 53 (2021) pp. 5–19 doi: https://doi.org/10.33039/ami.2021.02.001 url: https://ami.uni-eszterhazy.hu
高阶集中矩阵-指数分布的增强优化
本文给出了求解平方变异系数很低的高阶集中矩阵指数分布的数值方法。由于没有符号构造来获得最集中的矩阵指数分布,因此定义了非线性优化问题来获得高阶集中的矩阵指数分布。在优化问题的“完整”版本中,需要优化的参数数量随着顺序的增加而增加。对于无法实现“完全”优化的订单(n > 184),在[6]中提出了一种“启发式”优化过程,该过程仅优化3个与订单无关的参数。在这项工作中,我们提出了这个启发式优化过程的一个增强版本,只优化了与顺序无关的6个参数,这使得CME分布的SCV比现有的3参数方法更低。与旧程序相比,新程序的SCV增益为*。这项工作得到OTKA K-123914和NKFIH BME NC TKP2020项目的部分支持。数学与信息年鉴53 (2021)pp. 5-19 doi: https://doi.org/10.33039/ami.2021.02.001 url: https://ami.uni-eszterhazy.hu
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
0.90
自引率
0.00%
发文量
0
×
引用
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学术官方微信