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.
Test case 2 still have problems, I have implemented the Fletcher-Reeves Conjugate Gradient Method from 1964, and it got rejected at the 2nd test. I believe the problem is that you are requesting precision from the approximation of an approximation. And this can only be done when we are very close to the solution. Test 1 seems to have the right precision for 1 iteration.
Check to see if a Sudoku Puzzle is Solved
Acidity of vinegar and salts
Rotate a Matrix
Assign numerical values to a structure with 1 field
Map all the indices of an Array Indices into a Vector giving Index vs Row and Column
Sequential Unconstrained Minimization (SUMT) using Interior Penalty
Augmented Lagrange Multiplier (ALM) Method
Gauss Eliminate 2-by-2 example
Sequential Unconstrained Minimization (SUMT) using Exterior Penalty
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: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office