unc_n2_branin.m

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

function [f]=unc_n2_branin(x)
%reference:
%note that you can get the formulation of unc_n2_branin from some
%aritcles,such as
%(1)X Liu 'Finding Global Minima with a Computable Filled Function',
%Journal of Global Optimization,151-161'
%
%algorithm:
%below code is  edited according to 
%(1)X Liu 'Finding Global Minima with a Computable Filled Function',
%Journal of Global Optimization,151-161'
%
%solution:
% where the bounds are -5<=x1<=10,0<=x2<=15;
% The global minimum is at x*= (3.1416 , 2.2750) ,( -3.1416  , 12.2750) or
%(9.4248 ,   2.4750  )and and f(x*)=0.3979;


%Copyright:
% programmers:oiltowater.
% It comply with the GPL2.0
% Copyright 2006  oiltowater 



x1=x(1,1);
x2=x(2,1);
f=(x2-1.275*x1*x1/pi/pi+5*x1/pi-6).^2+10*(1-0.125/pi)*cos(x1)+10;