Global Optimization Toolbox User's Guide - MathWorks

patternsearch
problemtype — Type of problem: unconstrained, bound constrained
or linear constrained
pollmethod — Polling technique
searchmethod — Search technique used, if any
iterations — Total number of iterations
funccount — Total number of function evaluations
meshsize —Meshsizeatx
maxconstraint — Maximum constraint violation, if any
message — Reason why the algorithm terminated
Note patternsearch does not accepts functions whose inputs are of
type complex. To solve problems involving complex data, write your
functions so that they accept real vectors, by separating the real and
imaginary parts.
Examples Given the following constraints
⎡ 1
⎢
⎢
−1
⎣⎢
2
1⎤
2
1
2
⎥ ⎡ ⎤
⎥ ⎢ ⎥ 2
2
1⎦⎥
⎣ ⎦
3
0 0
≤
⎡ ⎤
x ⎢ ⎥
⎢ ⎥
,
x
⎣⎢
⎦⎥
x ≥ , x ≥ ,
1 2
the following code finds the minimum of the function, lincontest6,
that is provided with your software:
A = [1 1; -1 2; 2 1];
b = [2; 2; 3];
lb = zeros(2,1);
[x,fval,exitflag] = patternsearch(@lincontest6,[0 0],...
A,b,[],[],lb)
Optimization terminated: mesh size less than
12-51