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
Show
1 older comment
Robert Canfield
on 16 Mar 2012
Yes.
@bmtran (Bryant Tran)
on 19 Mar 2012
neat!
Rafael S.T. Vieira
on 17 Jun 2020
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 commentsGroup

Computational Geometry II
- 20 Problems
- 18 Finishers
- Dots in a Diamond
- Property dispute!
- Shifted Hexagonal Tiling Dots in a Circle
- Hexagonal Tiling Dots in a Circle
- Dots in a Sphere
- Triangular Tiling Dots in a Circle
- Beads on a Necklace (Convex Hulls)
- Minimum Distance between two N-sided Polygons
- Minimum Distance Point to Segment
- Dots in a Circle
- Edges of a n-dimensional Hypercube
- Volume of a Simplex
- Find the optimal shape to bring the maximum product by a given perimeter
- Number of lattice points within a circle
- Points on a circle.
- Perimeter
- Geometry: Find Circle given 3 Non-Colinear Points
- Points on a Sphere
- Volume difference between Ellipsoid and Sphere
- Property dispute!
- Crossing to Kissing - Untangle the Lines
Problem Recent Solvers28
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!