Problem 7: Gradient descent (5 pts) Solve the following optimization problem by gradient descent for two iterations from $x_0 = \frac{\pi}{4}$ with a step size $\alpha = 0.1$. Evaluate the function value at the iterations. $\min_x f(x) = e^x \sin(x) + x^3$
Added by David H.
Close
Step 1
Step 1: Calculate the gradient of the function f(x): f'(x) = e^x * sin(x) + e^x * cos(x) + 3x^2 Show more…
Show all steps
Your feedback will help us improve your experience
Adi S and 90 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
29. Use the method of steepest descent to approximate (up to the given iterations) the optimal solution to the following problems: (a) Minimize z = 2x^2 + 2y^2 + 2xy - y; (1.0, 1.0), iter. = 2. (b) Minimize z = x^2 - 3y^2 - 4xy + 2x - y; (2.5, 1.5), iter. = 2. (c) Minimize z = (x + 2)^2 + (y - 1)^2 - y; (0.0, 1.0), iter. = 2. (d) Minimize z = (x - 1)^2 + 2y^2 + xy - x; (0.5, 1.5), iter. = 2.
Adi S.
Perform two iterations of the optimal gradient steepest descent method to locate the minimum of: f(x,y) = -8x + x^2 + 12y + 4y^2 - 2xy using initial guesses x = 0 and y = 0. Report the percent true error of both iterations.
Tahleem K.
(Steepest Descent) Suppose that we seek to minimize f(x1,x2) = 5x1^2 + 5x2^2 - x1x2 - 11x1 + 11x2 + 11. a) Find a point satisfying the first-order necessary conditions for a solution. b) Show that this point is a global minimum of f(x). c) Starting at (x1,x2) = (0,0), at most how many steepest descent iterations would it take to reduce the function value to 10^-11? d) Plot the path taken in the plane by the approximate solutions for each method from each starting point.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD