a new conjugate gradient algorithm with sufficient descent property for unconstrained optimization
Clicks: 5
ID: 237307
2015
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
1.2
/100
5 views
4 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #1,012 of 1,093 articles by views in journal of power sources
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,093 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
A new nonlinear conjugate gradient formula, which satisfies the sufficient descent condition, for solving unconstrained optimization problem is proposed. The global convergence of the algorithm is established under weak Wolfe line search. Some numerical experiments show that this new WWPNPRP+ algorithm is competitive to the SWPPRP+ algorithm, the SWPHS+ algorithm, and the WWPDYHS+ algorithm.
| Reference Key |
wu2015mathematicala
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;XiaoPing Wu;LiYing Liu;FengJie Xie;YongFei Li |
| Journal | journal of power sources |
| Year | 2015 |
| DOI |
10.1155/2015/352524
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.