A NEW THREE -TERM CONJUGATE GRADIENT ALGORITHM FOR SOLVING MINIMIZATION PROBLEMS

Dilovan H. Omar, S. Shareef, B. Fathi
{"title":"A NEW THREE -TERM CONJUGATE GRADIENT ALGORITHM FOR SOLVING MINIMIZATION PROBLEMS","authors":"Dilovan H. Omar, S. Shareef, B. Fathi","doi":"10.25271/sjuoz.2023.11.4.1152","DOIUrl":null,"url":null,"abstract":"The method of optimization is used to determine the most precise value for certain functions within a certain domain; it is mostly studied and employed in the fields of mathematics, computer science, and physics. This work presents a novel three-term conjugate gradient (CG) approach for unconstrained optimization problems. Both the descending criteria and the sufficient descent criterion were met by the new approach. The novel method that has been proposed has been evaluated for global convergence. The outcomes of numerical trials on a few well-known test functions demonstrated how highly successful our new modified method is, depending on the number of iterations (NOI) and the number of functions to be evaluated (NOF).","PeriodicalId":21627,"journal":{"name":"Science Journal of University of Zakho","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Science Journal of University of Zakho","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.25271/sjuoz.2023.11.4.1152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The method of optimization is used to determine the most precise value for certain functions within a certain domain; it is mostly studied and employed in the fields of mathematics, computer science, and physics. This work presents a novel three-term conjugate gradient (CG) approach for unconstrained optimization problems. Both the descending criteria and the sufficient descent criterion were met by the new approach. The novel method that has been proposed has been evaluated for global convergence. The outcomes of numerical trials on a few well-known test functions demonstrated how highly successful our new modified method is, depending on the number of iterations (NOI) and the number of functions to be evaluated (NOF).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求解最小化问题的新三项共轭梯度算法
优化的方法是确定某一域内某一函数的最精确值;它主要用于数学、计算机科学和物理领域的研究和应用。本文提出了一种新的求解无约束优化问题的三项共轭梯度方法。该方法同时满足下降准则和充分下降准则。所提出的新方法具有全局收敛性。对几个已知的测试函数进行数值试验的结果表明,根据迭代次数(NOI)和待评估函数数量(NOF),我们的新改进方法是多么成功。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
35
审稿时长
6 weeks
期刊最新文献
PROPAGATION AND CALLUS REGENERATION OF POTATO (SOLANUM TUBEROSUM L.) CULTIVAR ‘DESIREE’ UNDER SALT STRESS CONDITIONS THE PREDICTION OF HEART DISEASE USING MACHINE LEARNING ALGORITHMS PHYLOGENETIC STUDY OF TEN SPECIES FROM CENTAUREA (ASTERACEAE) IN DUHOK CITY, KURDISTAN REGION-IRAQ ENHANCING KURDISH SIGN LANGUAGE RECOGNITION THROUGH RANDOM FOREST CLASSIFIER AND NOISE REDUCTION VIA SINGULAR VALUE DECOMPOSITION (SVD) QUANTIFYING THE IMPACT OF RUNNING CADENCE ON BIOMECHANICS, PERFORMANCE, AND INJURY RISK: A PHYSICS-BASED ANALYSIS
×
引用
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