Implement convex minimization on an interval

Q: Implement convex minimization on an interval

This question evaluates understanding of convex optimization for black-box real-valued functions on a closed interval, testing algorithm selection, stopping criteria, time/space complexity, function-evaluation efficiency, and numerical robustness in handling flat regions and boundary optima.

Q: How do I approach Machine Learning interview questions?

Machine Learning questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master machine learning interviews.

Question

Task: Minimize a Black-Box Convex Function on [a, b] Using Only Function Evaluations

Context

You are given a real-valued, convex function F(x) defined on a closed interval [a, b]. The function is a black box: you can evaluate F(x) at chosen x but cannot access derivatives or internal structure.

Requirements

Implement in Python an algorithm to find x* ∈ [a, b] that minimizes F(x), using only function evaluations. Specifically:

Choose and justify an appropriate method (e.g., golden-section search or ternary search).
Specify stopping criteria (tolerance and maximum iterations).
Analyze time and space complexity and the number of function evaluations.
Discuss handling of:
- Numerical precision
- Non-strict convexity and flat regions
- Boundary optima
Provide clear, well-documented code.
Explain how you would test and verify correctness.

Implement convex minimization on an interval

Task: Minimize a Black-Box Convex Function on [a, b] Using Only Function Evaluations

Context

Requirements

Solution

Comments (0)

Implement convex minimization on an interval

Overview

Task: Minimize a Black-Box Convex Function on [a, b] Using Only Function Evaluations

Context

Requirements

Solution

Comments (0)