Algorithmintro
Golden-section search
Also called golden ratio search, golden section minimization.
Unimodal minimization that reuses one function evaluation per step by shrinking the interval by the golden ratio.
Unimodal minimization that reuses one function evaluation per step by shrinking the interval by the golden ratio.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag ZDRDPS Edit this page History Report an error