A Rapidly Convergent Descent Method for Minimization

Clicks: 2
ID: 289573
1963
Free PDF
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.
AI Quality Assessment
Not analyzed
Readership in this journal
Emerging

Ranked #24 of 36 articles by views in The Computer Journal

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create 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
Sign in to mint
Abstract
A powerful iterative descent method for finding a local minimum of a function of several variables is described. A number of theorems are proved to show that it always converges and that it converges rapidly. Numerical tests on a variety of functions confirm these theorems. The method has been used to solve a system of one hundred non-linear simultaneous equations.
Reference Key
openalex_W2022772618 Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors R. Fletcher, M. J. D. Powell
Journal The Computer Journal
Year 1963
DOI
10.1093/comjnl/6.2.163
URL
https://academic.oup.com/comjnl/article-pdf/6/2/163/1041527/6-2-163.pdf
Keywords Keywords not found

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.