The Convergence of a Class of Double-rank Minimization Algorithms
Clicks: 12
ID: 296980
1970
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
Popular Article
3.3
/100
12 views
3 readers
AI Quality Assessment
Not analyzed
Readership in this journal
PopularRanked #2 of 9 articles by views in ima journal of applied mathematics
Most read
Least read
Bar heights use a square-root scale.
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
This paper presents a new minimization algorithm and discusses theoretically some of its properties when applied to quadratic functions. Results of comparative testing for a set of non-quadratic functions are described and reasons for the observed experimental behaviour are suggested.
| Reference Key |
openalex_W2056641273
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | C. G. Broyden |
| Journal | ima journal of applied mathematics |
| Year | 1970 |
| DOI |
10.1093/imamat/6.3.222
|
| URL | |
| 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.