No label defined (Q3974973)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 17645
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 17645 |
Statements
26 June 1992
0 references
minimization of convex functions
0 references
global algorithms
0 references
global Newton method
0 references
0.8037897944450378
0 references
0.7983173727989197
0 references
0.7983173727989197
0 references
0.7962825894355774
0 references
[For the entire collection see Zbl 0726.00015.] From the author's summary: ``A global Newton method for finding a zero of a vector-valued function \(F\) is formulated. The method always converges, and automatically becomes an ordinary Newton method on the tail end of the sequence. An iteration count is given for the number of steps required to reduce the norm of \(F\) to less than any prescribed tolerance \(\varepsilon\). The iteration count is given in terms of a parameter \(\alpha\) which is generally unknown, nevertheless, the result is of interest for the perspective it furnishes. Moreover, to use the algorithm no knowledge of \(\alpha\) is necessary''.
0 references