A new MM algorithm for root‐finding problems

IF 16.4 1区 化学 Q1 CHEMISTRY, MULTIDISCIPLINARY
Xunjian Li, Shuang Li, Guo‐Liang Tian
{"title":"A new MM algorithm for root‐finding problems","authors":"Xunjian Li, Shuang Li, Guo‐Liang Tian","doi":"10.1111/stan.12345","DOIUrl":null,"url":null,"abstract":"The minorization–maximization (MM) algorithm is an optimization technique for iteratively calculating the maximizer of a concave target function rather than a root–finding tool. In this paper, we in the first time develop the MM algorithm as a new method for seeking the root of a univariate nonlinear equation . The key idea is to transfer the root–finding issue to iteratively calculate the maximizer of a concave target function by designing a new MM algorithm. According to the ascent property of the MM algorithm, we know that the proposed algorithm converges to the root and does not depend on any initial values, in contrast to Newton's method. Several statistical examples are provided to demonstrate the proposed algorithm.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2024-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1111/stan.12345","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

The minorization–maximization (MM) algorithm is an optimization technique for iteratively calculating the maximizer of a concave target function rather than a root–finding tool. In this paper, we in the first time develop the MM algorithm as a new method for seeking the root of a univariate nonlinear equation . The key idea is to transfer the root–finding issue to iteratively calculate the maximizer of a concave target function by designing a new MM algorithm. According to the ascent property of the MM algorithm, we know that the proposed algorithm converges to the root and does not depend on any initial values, in contrast to Newton's method. Several statistical examples are provided to demonstrate the proposed algorithm.
用于寻根问题的新型 MM 算法
最小化-最大化(MM)算法是一种迭代计算凹目标函数最大值的优化技术,而非寻根工具。在本文中,我们首次开发了 MM 算法,作为寻求单变量非线性方程根的一种新方法。其主要思想是通过设计一种新的 MM 算法,将寻根问题转移到迭代计算凹目标函数的最大值上。根据 MM 算法的上升特性,我们知道与牛顿方法相比,所提出的算法收敛于根,并且不依赖于任何初始值。我们提供了几个统计实例来演示所提出的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Accounts of Chemical Research
Accounts of Chemical Research 化学-化学综合
CiteScore
31.40
自引率
1.10%
发文量
312
审稿时长
2 months
期刊介绍: Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance. Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
×
引用
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学术官方微信