16.01.2015 Views

GAMS — The Solver Manuals - Available Software

GAMS — The Solver Manuals - Available Software

GAMS — The Solver Manuals - Available Software

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

102 COIN-OR<br />

• no: don’t skip<br />

• yes: skip<br />

skip corr in monotone mode: Skip the corrector step during monotone barrier parameter mode (unsupported!).<br />

<strong>The</strong> corrector step is not tried if the algorithm is currently in the monotone mode (see also option ”barrier<br />

strategy”).This option is only used if ”mu strategy” is ”adaptive”. <strong>The</strong> default value for this string option is<br />

”yes”.<br />

Possible values:<br />

• no: don’t skip<br />

• yes: skip<br />

slack move: Correction size for very small slacks.<br />

Due to numerical issues or the lack of an interior, the slack variables might become very small. If a slack<br />

becomes very small compared to machine precision, the corresponding bound is moved slightly. This parameter<br />

determines how large the move should be. Its default value is mach eps 3/4 . (See also end of Section 3.5 in the<br />

implementation paper - but actual implementation might be somewhat different.) <strong>The</strong> valid range for this real<br />

option is 0 ≤ slack move < +inf and its default value is 1.81899 · 10 −12 .<br />

theta max fact: Determines upper bound for constraint violation in the filter.<br />

<strong>The</strong> algorithmic parameter theta max is determined as theta max fact times the maximum of 1 and the constraint<br />

violation at initial point. Any point with a constraint violation larger than theta max is unacceptable to the filter<br />

(see Eqn. (21) in the implementation paper). <strong>The</strong> valid range for this real option is 0 < theta max fact < +inf<br />

and its default value is 10000.<br />

theta min fact: Determines constraint violation threshold in the switching rule.<br />

<strong>The</strong> algorithmic parameter theta min is determined as theta min fact times the maximum of 1 and the constraint<br />

violation at initial point. <strong>The</strong> switching rules treats an iteration as an h-type iteration whenever the current<br />

constraint violation is larger than theta min (see paragraph before Eqn. (19) in the implementation paper). <strong>The</strong><br />

valid range for this real option is 0 < theta min fact < +inf and its default value is 0.0001.<br />

tiny step tol: Tolerance for detecting numerically insignificant steps.<br />

If the search direction in the primal variables (x and s) is, in relative terms for each component, less than this<br />

value, the algorithm accepts the full step without line search. If this happens repeatedly, the algorithm will<br />

terminate with a corresponding exit message. <strong>The</strong> default value is 10 times machine precision. <strong>The</strong> valid range<br />

for this real option is 0 ≤ tiny step tol < +inf and its default value is 2.22045 · 10 −15 .<br />

tiny step y tol: Tolerance for quitting because of numerically insignificant steps.<br />

If the search direction in the primal variables (x and s) is, in relative terms for each component, repeatedly less<br />

than tiny step tol, and the step in the y variables is smaller than this threshold, the algorithm will terminate.<br />

<strong>The</strong> valid range for this real option is 0 ≤ tiny step y tol < +inf and its default value is 0.01.<br />

watchdog shortened iter trigger: Number of shortened iterations that trigger the watchdog.<br />

If the number of successive iterations in which the backtracking line search did not accept the first trial point<br />

exceeds this number, the watchdog procedure is activated. Choosing ”0” here disables the watchdog procedure.<br />

<strong>The</strong> valid range for this integer option is 0 ≤ watchdog shortened iter trigger < +inf and its default value<br />

is 10.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!