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 Fletcher-Reeves Conjugate Gradient Method.
Solution Stats
Solution Comments
Problem Recent Solvers18
Suggested Problems
-
1055 Solvers
-
Project Euler: Problem 3, Largest prime factor
167 Solvers
-
233 Solvers
-
Mr. Pyramidad & Ms. Whissy Bolower
21 Solvers
-
1245 Solvers
More from this Author17
Problem Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Solution 62276
something strange with test 2, my implementation fails on this test (because two iterations take me considerably closer to the minimum), perhaps this is something to do with the different forms of linesearch we are using?
Test case 2 is changed to account for your subsequent comment and to also to be far enough away from the solution so that it cannot converge in 2 iterations.