Problem 484. Steepest Descent Method

Created by Robert Canfield

Solve Later

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.

Solve

Solution Stats

95 Solutions
31 Solvers

Last Solution submitted on Jun 17, 2020

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

@bmtran (Bryant Tran) on 15 Mar 2012

are these extra credit homework assignments or something?

Robert Canfield on 16 Mar 2012

Yes.

@bmtran (Bryant Tran) on 19 Mar 2012

neat!

Rafael Siqueira Telles Vieira on 17 Jun 2020 at 14:13

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.

Problem Recent Solvers31

Problem Tags

aoe4084 banana unconstrained

Problem 484. Steepest Descent Method

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers31

Suggested Problems

More from this Author17

Problem Tags

Problem 484. Steepest Descent Method

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers31

Suggested Problems

More from this Author17

Problem Tags

Players