FastPrepGradient Descent on a Sinusoidal Objective
Problems/Gradient Descent on a Sinusoidal Objective

Gradient Descent on a Sinusoidal Objective

Headlands Technologies logoHeadlands Technologies● MediumFULLTIMEPHONE SCREEN
QuestionFunctionExamplesConstraints

Problem statement

Source note: The report asks for gradient descent on x² − 2x + 1 + 3 sin(πx). It does not supply an initialization, learning rate, stopping rule or output convention. This practice preserves that exact objective and gradient-descent task; the stable starting range, supplied rate, finite update budget and two-number return are authored. Approximate source match: 60%.

Use gradient descent to seek a minimum of f(x) = x*x - 2*x + 1 + 3*sin(pi*x), where pi is π and trigonometric arguments are in radians.

Start at x = initialX and perform exactly iterations updates with the constant learningRate. Each update uses the derivative at the current x:

x = x - learningRate * (2*x - 2 + 3*pi*cos(pi*x)).

Return [x, f(x)] after the last update. With zero iterations, return the initial x and its objective value. Use double precision; an absolute or relative error of 1e-6 is accepted for each returned number. A sufficiently accurate numerical derivative is also allowed.

For this exercise, the starting interval and step-size bounds keep the updates in a stable convex region. A finite update budget returns an estimate; do not replace the requested updates with an unrelated optimizer or a hardcoded minimizer.

Function

gradientDescent(initialX: double, learningRate: double, iterations: int) → double[]

Examples

Example 1

initialX = 1.5learningRate = 0.01iterations = 0return = [1.5,-2.75]

No update is made: x=1.5 and f(x)=-2.75.

Example 2

initialX = 1.5learningRate = 0.01iterations = 1return = [1.49,-2.7584196810971946]

The initial derivative is 1, so the next x is 1.49. Evaluate the original objective at that updated x.

Example 3

initialX = 1.5learningRate = 0.01iterations = 100return = [1.4683142604203359,-2.7658306044951817]

Apply 100 gradient updates. The result is an estimate from this finite budget, rather than a general global-minimum guarantee.

Constraints

  • 1.0 <= initialX <= 2.0.
  • 0.000001 <= learningRate <= 0.03.
  • 0 <= iterations <= 10000.
  • The inputs are finite numbers. All trigonometric calculations use radians.

More Headlands Technologies problems

  • Integer Compression OffsetPHONE SCREEN · Seen Oct 2026
  • Array Interval SumsOA · Seen Oct 2026
  • Job Runner Chain ReportsOA · Seen Oct 2026
All Headlands Technologies interview questionsSee Headlands Technologies hiring insights
Saved
class Solution {
    public double[] gradientDescent(double initialX, double learningRate, int iterations) {
        // write your code here
    }
}
Checking account…