Uploaded May 2020 | Updated November 2026, 3 hours ago
Ternary Search is an interval-based divide-and-conquer algorithm for finding the minimum of a unimodal function. This video describes how to find a minimum when the derivative is know, defines unimodal, presents interval-based approaches for minimum finding, and visualizes the algorithm. Example code available on GitHub github.com/osveliz/numerical-veliz
*Correction* The numerical example used epsilon = 10^(-6) not 10^(-7) see Video Mistakes II: The Sequel youtu.be/YEUbzqkJBf0
Chapters
0:00 Intro
0:23 Minimum Finding
0:42 Derivative Plot
1:01 Minimum Strategy: Derivative
1:32 Unimodal
2:24 Unimodal Examples
2:35 Not Unimodal Examples
2:48 Maximum Finding?
3:11 Splitting into Intervals
4:26 Minimum Strategy: Intervals
5:09 Ternary Search Algorithm
5:58 Ternary Search Visualized
6:32 Numerical Example
7:03 Optimization 1 - Test Ends
7:39 Optimization 2 - Check Equal
7:56 Discussion
8:28 Oscar's Notes
9:04 Thank You
Suggested Viewing:
Bisection Method youtu.be/MlP_W-obuNg
Dichotomous Search youtu.be/n_zefNBfhSM
Fibonacci Search youtu.be/GAafWFRGP7k
Golden-section Search youtu.be/wpGN2xus75w
Jarratt's Method - Successive Parabolic Interpolation youtu.be/3WHcQofG7B8
Minimum Finding Playlist youtube.com/playlist?list=PLb0Tx2oJWuYIXLHAjQgko2fZtJ_NxnV-x
Reference:
Algorithms for Minimization without Derivatives by Richard P. Brent https://maths-people.anu.edu.au/~brent/pub/pub011.html
#TernarySearch #NumericalAnalysis
Ternary Search is an interval-based divide-and-conquer algorithm for finding the minimum of a unimodal function. This video describes how to find a minimum when the derivative is know, defines unimodal, presents interval-based approaches for minimum finding, and visualizes the algorithm. Example code available on GitHub github.com/osveliz/numerical-veliz
*Correction* The numerical example used epsilon = 10^(-6) not 10^(-7) see Video Mistakes II: The Sequel youtu.be/YEUbzqkJBf0
Chapters
0:00 Intro
0:23 Minimum Finding
0:42 Derivative Plot
1:01 Minimum Strategy: Derivative
1:32 Unimodal
2:24 Unimodal Examples
2:35 Not Unimodal Examples
2:48 Maximum Finding?
3:11 Splitting into Intervals
4:26 Minimum Strategy: Intervals
5:09 Ternary Search Algorithm
5:58 Ternary Search Visualized
6:32 Numerical Example
7:03 Optimization 1 - Test Ends
7:39 Optimization 2 - Check Equal
7:56 Discussion
8:28 Oscar's Notes
9:04 Thank You
Suggested Viewing:
Bisection Method youtu.be/MlP_W-obuNg
Dichotomous Search youtu.be/n_zefNBfhSM
Fibonacci Search youtu.be/GAafWFRGP7k
Golden-section Search youtu.be/wpGN2xus75w
Jarratt's Method - Successive Parabolic Interpolation youtu.be/3WHcQofG7B8
Minimum Finding Playlist youtube.com/playlist?list=PLb0Tx2oJWuYIXLHAjQgko2fZtJ_NxnV-x
Reference:
Algorithms for Minimization without Derivatives by Richard P. Brent https://maths-people.anu.edu.au/~brent/pub/pub011.html
#TernarySearch #NumericalAnalysis










