Minimizing scalar functions (minimize_scalar) in SciPy - Step-by-Step Execution

Concept Flow - Minimizing scalar functions (minimize_scalar)

Define scalar function f(x)

↓

Call minimize_scalar(f)

↓

Algorithm searches for x minimizing f(x)

↓

Check convergence?

No→Adjust search interval

Yes↓

Return x with minimum f(x)

We start with a function to minimize, then the algorithm searches for the x value that gives the smallest function value, adjusting its search until it converges.

Execution Sample

SciPy

from scipy.optimize import minimize_scalar

def f(x):
    return (x - 2)**2

result = minimize_scalar(f)
print(result.x, result.fun)

This code finds the x value that makes f(x) smallest and prints that x and the minimum value.

Execution Table

Step	Action	Current x	f(x)	Notes
1	Start search	0.0 (default start)	4.0	Initial guess f(0) = (0-2)^2=4
2	Evaluate at x=1.0	1.0	1.0	Better than 4, move search closer to 2
3	Evaluate at x=2.0	2.0	0.0	Found minimum f(2)=0
4	Check convergence	2.0	0.0	Converged to minimum
5	Return result	2.0	0.0	Stop search, minimum found

💡 Converged when function value stopped improving significantly at x=2.0

Variable Tracker

Variable	Start	After Step 2	After Step 3	Final
x	0.0	1.0	2.0	2.0
f(x)	4.0	1.0	0.0	0.0

Key Moments - 2 Insights

Why does the algorithm check multiple x values instead of just guessing once?

Because the algorithm needs to find the lowest point by comparing function values at different x, as shown in steps 1 to 3 in the execution_table.

What does convergence mean in this context?

Convergence means the algorithm found an x where f(x) is as low as possible and further searching doesn't improve it, as seen in step 4.

Visual Quiz - 3 Questions

Look at the execution_table, what is the value of f(x) at step 3?

A 0.0

B 1.0

C 4.0

D 2.0

💡 Hint

Check the 'f(x)' column in row for step 3 in execution_table.

At which step does the algorithm decide it has converged?

A Step 2

B Step 3

C Step 4

D Step 5

💡 Hint

Look for the row mentioning 'Check convergence' in execution_table.

If the function was f(x) = (x - 5)**2, how would the final x value change?

A It would be 2.0

B It would be 5.0

C It would be 0.0

D It would not change

💡 Hint

The minimum is where (x - target)^2 is zero, so x equals the target value.

Concept Snapshot

minimize_scalar(f)
- Finds x minimizing scalar function f(x)
- Uses iterative search adjusting x
- Stops when minimum found (convergence)
- Returns result with x and f(x) values
- Useful for simple 1D optimization problems

Full Transcript

We start by defining a simple function f(x) that we want to minimize. The minimize_scalar function from scipy.optimize tries different x values to find where f(x) is smallest. It begins with a guess, evaluates f(x), then tries better guesses based on results. When it finds an x where f(x) stops improving, it stops and returns that x and the minimum value. This process is called convergence. The example shows how the algorithm moves from x=0 to x=1 to x=2, finding the minimum at x=2 where f(x)=0. This method is useful for finding minimum points of simple functions in one variable.