Bird
0
0

When using basin-hopping to minimize a function with many local minima, which approach is most effective to improve the chance of finding the global minimum?

hard📝 Application Q8 of 15
SciPy - Advanced Optimization
When using basin-hopping to minimize a function with many local minima, which approach is most effective to improve the chance of finding the global minimum?
AUse a fixed seed for the random number generator to ensure reproducibility
BReduce the number of iterations to avoid overfitting
CDisable local minimization to speed up the process
DIncrease the step size of random perturbations and the number of iterations
Step-by-Step Solution
Solution:
  1. Step 1: Understand basin-hopping parameters

    Step size controls the magnitude of random jumps; more iterations allow more exploration.
  2. Step 2: Effect of increasing step size and iterations

    Larger steps help escape local minima; more iterations increase chances to find global minimum.
  3. Step 3: Evaluate other options

    Reducing iterations or disabling local minimization reduces effectiveness; fixed seed affects reproducibility, not optimization quality.
  4. Final Answer:

    Increase the step size of random perturbations and the number of iterations -> Option D
  5. Quick Check:

    More iterations and bigger steps improve global search [OK]
Quick Trick: Bigger steps plus more iterations help escape local minima [OK]
Common Mistakes:
  • Thinking fewer iterations improve results
  • Disabling local minimization to speed up
  • Confusing reproducibility with optimization quality

Want More Practice?

15+ quiz questions · All difficulty levels · Free

Free Signup - Practice All Questions
More SciPy Quizzes