Efficient hybrid algorithms for finding zeros of convex functions (Q1333238)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient hybrid algorithms for finding zeros of convex functions |
scientific article; zbMATH DE number 638537
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient hybrid algorithms for finding zeros of convex functions |
scientific article; zbMATH DE number 638537 |
Statements
Efficient hybrid algorithms for finding zeros of convex functions (English)
0 references
13 September 1994
0 references
Two hybrid algorithms for finding an \(\varepsilon\)-approximation of a root of a convex function are considered. The first algorithm combines a binary search procedure with Newton's method. The second algorithm combines a binary search with the secant method in a similar fashion.
0 references
hybrid algorithms
0 references
convex function
0 references
binary search procedure
0 references
Newton's method
0 references
secant method
0 references
