A class of algorithms for computing the minimal value of a convex function<i>f</i>over[0 1]<i><sup>k</sup></i>within accuracy ∊, when the evaluations of<i>f</i>are made within accuracy ∊ (Q3727747)
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 class of algorithms for computing the minimal value of a convex functionfover[0 1]kwithin accuracy ∊, when the evaluations offare made within accuracy ∊ |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of algorithms for computing the minimal value of a convex function<i>f</i>over[0 1]<i><sup>k</sup></i>within accuracy ∊, when the evaluations of<i>f</i>are made within accuracy ∊ |
scientific article |
Statements
A class of algorithms for computing the minimal value of a convex function<i>f</i>over[0 1]<i><sup>k</sup></i>within accuracy ∊, when the evaluations of<i>f</i>are made within accuracy ∊ (English)
0 references
1986
0 references
sequential minimization
0 references
stability and complexity of algorithms
0 references
nonsmooth
0 references
golden section search
0 references
