Code covered by the BSD License
-
evallag (f, c, x, lambda)
Evaluate the lagrangian system and it's first derivative in a pair
-
evbranin(x)
Name: Branin
-
evbrown(x)
Name: Brown's Almost Linear
-
evbullardbiegler(x)
Name: Bullard&Biegler
-
evcg11(x)
-
evcg13(x)
-
evcg3(x)
-
evcombustion(x)
Name: Equilibrium Combustion
-
eveasom(x)
Name: Easom
-
evferraristronconi(x)
Name: Ferraris&Tronconi
-
evfg11(x)
-
evfg13(x)
-
evfg3(x)
-
evgoldsteinprice(x)
Name: Goldstein&Price
-
evgriewank(x)
Name: Griewank
-
evhimmelblau(x)
Name: Himmelblau
-
evhumpcamel(x)
Name: Three Hump Camel
-
evkubicek(x)
Name: Kubicek
-
evlevy(x)
Name: Levy
-
evmichalewicz(x)
Name: Michalewicz
-
evrastrigin(x)
Name: Rastrigin
-
evrosenbrock(x)
Name: Rosenbrock
-
evshubert(x)
Name: Shubert
-
evsmith(x)
Name: Smith
-
evtrigonometric(x)
Name: Trigonometric
-
intdiv(a, b)
Extended interval division. This implementation follows the technical
-
intksolve(f, x0, options)
Apply the Krawczyk operator to test existence of zeros of a nonlinear
-
intmincon(f, x0, nonlcon, opt...
Find the global minima of a function f inside a box x0 subject to
-
intminunc(f, x0, options)
Find the global minima of a function f inside the box x0. The user must
-
intoptimget(options)
Display parameters setted by an option vector. If no input arguments are
-
intoptimset()
Create an optimization options vector. To change default settings on
-
intsolve(f, x0, options)
Find all zeros of a nonlinear system of equations inside an
-
nonnullgs (X, x, b, M)
Perform one step of the interval gauss seidel method to solve the problem
-
nullgs (X, x, b, M)
Perform one step of the interval gauss seidel method to solve the problem
-
sibranin(type)
Branin problem initial data.
-
sibrown(type)
Brown Almost linear problem initial data.
-
sibullardbiegler(type)
Bullard&Biegler problem initial data.
-
sicombustion(type)
Combustion problem initial data.
-
sieasom(type)
Rastrigin problem initial data.
-
siferraristronconi(type)
Ferraris&Tronconi problem initial data.
-
sig11(type)
-
sig13(type)
-
sig3(type, n)
-
sigoldsteinprice(type)
Goldstein&Price problem initial data.
-
sigriewank(type, n)
Griewank's problem initial data.
-
sihimmelblau(type)
Himmelblau problem initial data.
-
sihumpcamel(type)
Three hump camel problem initial data.
-
sikubicek(type)
Kubicek problem initial data.
-
silevy(type, n)
Levy's problem initial data.
-
simichalewicz(type, n)
Michalewicz's problem initial data.
-
sirastrigin(type, n)
Rastrigin problem initial data.
-
sirosenbrock(type, n)
Ronsenbrock's problem initial data.
-
sishubert(type)
Shubert's problem initial data.
-
sismith(type)
Smith problem initial data.
-
sitrigonometric(type, n)
Trigonometric problem initial data.
-
View all files
from
INTSOLVER: An interval based solver for Global Optimization
by Tiago Montanher
Interval based functions to solve small global optimization problems with guaranteed bounds.
|
| intoptimset() |
function options = intoptimset()
% Create an optimization options vector. To change default settings on
% Intesolve methods you must run this function specifying an output
% vector and change the needed settings. Rum intoptimget function to see
% the parameters setted in an options vector
%
% Example of Usage:
% >> opt = intoptimset();
% >> opt(1) = 10^-10; % Set the function tolerance to 10^-10.
% >> opt(8) = 1; % Change the display level to 1.
% >> x = intminunc(func, x0, opt);
%
% This is an INTLAB file. It requires to have INTLAB installed under
% MATLAB to works properly.
%
% Arguments with * are needed.
%
% Argument i/o description
% options* o Options vector
% options(1) Function tolerance. epsF
%
% options(2) Box tolerance.epsX
%
% options(3) Equality constraints tolerance. epsEC
% (Constrained optimization problems only).
%
% options(4) Initial guess for global minimum. (Optimiza
% tion problems only).
%
% options(5) Maximum number of iterations allowed.
%
% options(6) Maximum number of function evaluations
% allowed.
%
% options(7) Maximum number of equality constraint
% evaluations allowed. Constrained optimization problems
% only.
%
% options(8) Level of display
% 0 = no information.
% n = display informations at each n iterations.
%
% options(9) Iterate until convergence. If true ignores
% any values in options 5, 6 and 7.
%
%
% WARRANTY
%
% Because the program is licensed free of charge, there is
% no warranty for the program, to the extent permitted by applicable
% law. Except when otherwise stated in writing the copyright holder
% and/or other parties provide the program "as is" without warranty
% of any kind, either expressed or implied, including, but not
% limited to, the implied warranties of merchantability and fitness
% for a particular purpose. The entire risk as to the quality and
% performance of the program is with you. Should the program prove
% defective, you assume the cost of all necessary servicing, repair
% or correction.
%
% History
%
% 02-13-2009 first version
if nargout < 1
error('Missing arquments. you must specify an output vector (For example opt = intoptimset())');
end
options(1) = 10^-8; % Function Tolerance (epsF).
options(2) = 10^-8; % Box Tolerance (epsX).
options(3) = 10^-8; % Equality constraints tolerance (epsEC).
% Constrained Problems only.
options(4) = inf; % Initial guess for the global minimum.
% Optimization problems only.
options(5) = 1000; % Maximum number of iterations allowed.
options(6) = 10000; % Maximum number of function evaluations allowed.
options(7) = 10000; % Maximum number of equality constraint
% evaluations allowed. Constrained problems only.
options(8) = 10; % Level of Display.
options(9) = 0; % Iterate until convergence.
end
|
|
Contact us at files@mathworks.com