A rapidly convergent five-point algorithm for univariate minimization (Q1321651)
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: A rapidly convergent five-point algorithm for univariate minimization |
scientific article; zbMATH DE number 558699
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A rapidly convergent five-point algorithm for univariate minimization |
scientific article; zbMATH DE number 558699 |
Statements
A rapidly convergent five-point algorithm for univariate minimization (English)
0 references
23 May 1994
0 references
The authors present an algorithm for minimizing a univariate function which is not necessarily differentiable. The algorithm uses function, but not derivative, values at five-points to generate each iterate. It employs quadratic and polyhedral approximations.
0 references
nonsmooth optimization
0 references
univariate function
0 references
0 references
0 references
0 references
