Problem 484. Steepest Descent Method
Write a function to find the values of a design variable vector, x, that minimizes an unconstrained scalar objective function, f, given a function handle to f and its gradient, a starting guess, x0, a gradient tolerance, TolGrad, and a maximum number of iterations, MaxIter, using the Steepest Descent Method.
Solution Stats
Problem Comments
-
4 Comments
are these extra credit homework assignments or something?
Yes.
neat!
Max iterations in the test cases should be higher. For instance, unless we are calculating the exact solution, one iteration is not realistic. People are overcoming this by increasing the number inside their code or using matlab functions that can freely iterate in their code.
Solution Comments
Show commentsProblem Recent Solvers27
Suggested Problems
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2107 Solvers
-
Back to basics 22 - Rotate a matrix
891 Solvers
-
Given a window, how many subsets of a vector sum positive
850 Solvers
-
193 Solvers
-
Remove entire row and column in the matrix containing the input values
340 Solvers
More from this Author17
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!