A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations.

IF 1.6 3区 数学 Q1 Mathematics
Journal of Inequalities and Applications Pub Date : 2018-01-01 Epub Date: 2018-05-11 DOI:10.1186/s13660-018-1703-1
Gonglin Yuan, Wujie Hu
{"title":"A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations.","authors":"Gonglin Yuan,&nbsp;Wujie Hu","doi":"10.1186/s13660-018-1703-1","DOIUrl":null,"url":null,"abstract":"<p><p>For large-scale unconstrained optimization problems and nonlinear equations, we propose a new three-term conjugate gradient algorithm under the Yuan-Wei-Lu line search technique. It combines the steepest descent method with the famous conjugate gradient algorithm, which utilizes both the relevant function trait and the current point feature. It possesses the following properties: (i) the search direction has a sufficient descent feature and a trust region trait, and (ii) the proposed algorithm globally converges. Numerical results prove that the proposed algorithm is perfect compared with other similar optimization algorithms.</p>","PeriodicalId":49163,"journal":{"name":"Journal of Inequalities and Applications","volume":"2018 1","pages":"113"},"PeriodicalIF":1.6000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13660-018-1703-1","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Inequalities and Applications","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1186/s13660-018-1703-1","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2018/5/11 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 17

Abstract

For large-scale unconstrained optimization problems and nonlinear equations, we propose a new three-term conjugate gradient algorithm under the Yuan-Wei-Lu line search technique. It combines the steepest descent method with the famous conjugate gradient algorithm, which utilizes both the relevant function trait and the current point feature. It possesses the following properties: (i) the search direction has a sufficient descent feature and a trust region trait, and (ii) the proposed algorithm globally converges. Numerical results prove that the proposed algorithm is perfect compared with other similar optimization algorithms.

求解大规模无约束优化问题和非线性方程的共轭梯度算法。
针对大规模无约束优化问题和非线性方程,提出了一种基于元维鲁线搜索技术的三项共轭梯度算法。它将最陡下降法与著名的共轭梯度算法相结合,利用了相关函数特征和当前点特征。该算法具有以下特点:(1)搜索方向具有充分的下降特征和信任域特征,(2)算法全局收敛。数值结果表明,与其他同类优化算法相比,该算法是完美的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Inequalities and Applications
Journal of Inequalities and Applications MATHEMATICS, APPLIED-MATHEMATICS
CiteScore
3.30
自引率
6.20%
发文量
136
审稿时长
3 months
期刊介绍: The aim of this journal is to provide a multi-disciplinary forum of discussion in mathematics and its applications in which the essentiality of inequalities is highlighted. This Journal accepts high quality articles containing original research results and survey articles of exceptional merit. Subject matters should be strongly related to inequalities, such as, but not restricted to, the following: inequalities in analysis, inequalities in approximation theory, inequalities in combinatorics, inequalities in economics, inequalities in geometry, inequalities in mechanics, inequalities in optimization, inequalities in stochastic analysis and applications.
×
引用
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学术官方微信