Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
% Rosenbrock's banana function
F=@(x) 100*(x(2)-x(1).^2).^2 + (1-x(1)).^2;
gradF=@(x) [100*(4*x(1).^3-4*x(1).*x(2))+2*x(1)-2; 100*(2*x(2)-2*x(1).^2)];
x0 = [-1.9; 2.0];
x1=[
-1.4478
2.1184];
x2=[
1.7064
2.9446];
f1=6.0419;
f2=0.6068;
[xmin,fmin]=SteepestDescent(F,gradF,x0,0.01,1)
assert(norm(xmin-x1)<0.2||norm(xmin-x2)<0.2)
assert( abs(fmin-f1)<0.5|| abs(fmin-f2)<0.5) % 2 local min
ans =
1
Exiting: Maximum number of iterations has been exceeded
- increase MaxIter option.
Current function value: 6.004580
xmin =
-1.4462
2.1058
fmin =
6.0046
|
2 | Pass |
%%
% Rosenbrock's banana function
F=@(x) 100*(x(2)-x(1).^2).^2 + (1-x(1)).^2;
gradF=@(x) [100*(4*x(1).^3-4*x(1).*x(2))+2*x(1)-2; 100*(2*x(2)-2*x(1).^2)];
x0 = [0; 0];
xcorrect=[1;1];
fcorrect=0;
[xmin,fmin]=SteepestDescent(F,gradF,x0) % 20 iterations default
assert(norm((xmin-xcorrect),inf)<1)
assert(abs(fmin-fcorrect)<0.8);
xmin =
1.0000
1.0000
fmin =
3.6862e-10
|
3 | Pass |
%%
% Rosenbrock's banana function
F=@(x) 100*(x(2)-x(1).^2).^2 + (1-x(1)).^2;
gradF=@(x) [100*(4*x(1).^3-4*x(1).*x(2))+2*x(1)-2; 100*(2*x(2)-2*x(1).^2)];
x0 = [1.1; 0.9];
xcorrect=[1;1];
fcorrect=0;
[xmin,fmin]=SteepestDescent(F,gradF,x0,1e-2,2000)
assert(isequal(round(xmin),xcorrect))
assert(isequal(round(fmin),fcorrect))
ans =
2000
xmin =
1.0000
1.0000
fmin =
5.9334e-10
|
1326 Solvers
248 Solvers
The Hitchhiker's Guide to MATLAB
2874 Solvers
Project Euler: Problem 1, Multiples of 3 and 5
1490 Solvers
Construct a string from letters and counts
128 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!