unc_n2_goldsteinplot.asv

it contains many classic Test Problems for Unconstrained Optimization such as camel6,treccani,goldst

clear
clc

% lb=-3;
% ub=3;
% teix=0.01;
% [X,Y] = meshgrid(lb:teix:ub);
% g=1+((X+Y+1).^2).*(19-14*X+3*X.^2-14*Y+6*X.*Y+3*Y.^2);
% h=30+((2*X-3*Y).^2).*(18-32*X+12*X^2+48*Y-36*X.*Y+27*Y.^2);
% Z=g.*h;
% mesh(X,Y,Z)
% axis([lb ub lb ub -100 5*1e6 ]);%-6*1e6
% title('unc#n2#goldstein');
% xlabel('x');
% ylabel('y');
% zlabel('z')


% %contour
lb=-3;
ub=3;
teix=0.1;
[X,Y] = meshgrid(lb:teix:ub,lb:teix:ub);
g=1+((X+Y+1).^2).*(19-14*X+3*X.^2-14*Y+6*X.*Y+3*Y.^2);
h=30+((2*X-3*Y).^2).*(18-32*X+12*X^2+48*Y-36*X.*Y+27*Y.^2);
Z=g.*h;
v=[ -1e6 -10000  0 3  10000 1e6   ];
v=[-1000 -100 -10 0];
[c,h]=contour(X,Y,Z,v);
clabel(c,h);
title('unc#n2#goldstein');
xlabel('x');
ylabel('y');