You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 

59 lines
1.8 KiB

%-------------------------------------------------------------
%
% Copyright (C) 2009 Krister Svanberg
%
% This file, gctoyinit.m, is part of GCMMA-MMA-code.
%
% GCMMA-MMA-code is free software; you can redistribute it and/or
% modify it under the terms of the GNU General Public License as
% published by the Free Software Foundation; either version 3 of
% the License, or (at your option) any later version.
%
% This code is distributed in the hope that it will be useful,
% but WITHOUT ANY WARRANTY; without even the implied warranty of
% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
% GNU General Public License for more details.
%
% You should have received a copy of the GNU General Public License
% (file COPYING) along with this file. If not, see
% <http://www.gnu.org/licenses/>.
%
% You should have received a file README along with this file,
% containing contact information. If not, see
% <http://www.smoptit.se/> or e-mail mmainfo@smoptit.se or krille@math.kth.se.
%
%------
%
% Version September 2009.
%
% Some parameters and the starting point are defined
% for the "toy problem":
% minimize x(1)^2 + x(2)^2 + x(3)^2
% subject to (x(1)-5)^2 + (x(2)-2)^2 + (x(3)-1)^2 =< 9
% (x(1)-3)^2 + (x(2)-4)^2 + (x(3)-3)^2 =< 9
% 0 =< x(j) =< 5, for j=1,2,3.
%
%
m = 2;
n = 3;
epsimin = 0.0000001;
xval = [4 3 2]';
xold1 = xval;
xold2 = xval;
xmin = [0 0 0]';
xmax = [5 5 5]';
low = xmin;
upp = xmax;
c = [1000 1000]';
d = [1 1]';
a0 = 1;
a = [0 0]';;
raa0 = 0.01;
raa = 0.01*[1 1]';
raa0eps = 0.000001;
raaeps = 0.000001*[1 1]';
outeriter = 0;
maxoutit = 1;
kkttol = 0;
%
%---------------------------------------------------------------------