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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

536 SNOPT<br />

• t must be a real value in the range 0.0 ≤ t ≤ 1.0.<br />

• <strong>The</strong> default value t = 0.9 requests just moderate accuracy in the linesearch.<br />

• If the nonlinear functions are cheap to evaluate (this is usually the case for <strong>GAMS</strong> models), a more<br />

accurate search may be appropriate; try t = 0.1, 0.01 or 0.001. <strong>The</strong> number of major iterations might<br />

decrease.<br />

• If the nonlinear functions are expensive to evaluate, a less accurate search may be appropriate. In<br />

the case of running under <strong>GAMS</strong> where all gradients are known, try t = 0.99. (<strong>The</strong> number of<br />

major iterations might increase, but the total number of function evaluations may decrease enough to<br />

compensate.)<br />

Default: Linesearch tolerance 0.9.<br />

Log frequency k<br />

See Print frequency.<br />

Default: Log frequency 100<br />

LU factor tolerance r 1<br />

LU update tolerance r 2<br />

<strong>The</strong>se tolerances affect the stability and sparsity of the basis factorization B = LU during refactorization<br />

and updating, respectively. <strong>The</strong>y must satisfy r 1 , r 2 ≥ 1.0. <strong>The</strong> matrix L is a product of matrices of the<br />

form (<br />

1<br />

µ 1<br />

where the multipliers µ satisfy |µ| ≤ r i . Smaller values of r i favor stability, while larger values favor sparsity.<br />

• For large and relatively dense problems, r 1 = 5.0 (say) may give a useful improvement in stability<br />

without impairing sparsity to a serious degree.<br />

• For certain very regular structures (e.g., band matrices) it may be necessary to reduce r 1 and/or r 2 in<br />

order to achieve stability. For example, if the columns of A include a submatrix of the form<br />

⎛<br />

⎜<br />

⎝<br />

)<br />

2 −1<br />

−1 2 −1<br />

−1 2 −1<br />

. .. . .. . ..<br />

both r 1 and r 2 should be in the range 1.0 ≤ r i < 2.0.<br />

,<br />

−1 2 −1<br />

−1 2<br />

Defaults for linear models: LU factor tolerance 100.0 and LU update tolerance 10.0.<br />

<strong>The</strong> defaults for nonlinear models are LU factor tolerance 3.99 and LU update tolerance 3.99.<br />

LU partial pivoting<br />

LU rook pivoting<br />

LU complete pivoting<br />

<strong>The</strong> LUSOL factorization implements a Markowitz-type search for pivots that locally minimize the fill-in<br />

subject to a threshold pivoting stability criterion. <strong>The</strong> rook and complete pivoting options are more<br />

expensive than partial pivoting but are more stable and better at revealing rank, as long as the LU<br />

factor tolerance is not too large (say t 1 < 2.0).<br />

When numerical difficulties are encountered, SNOPT automatically reduces the LU tolerances toward 1.0<br />

and switches (if necessary) to rook or complete pivoting before reverting to the default or specified options<br />

at the next refactorization. (With System information Yes, relevant messages are output to the listing<br />

file.)<br />

Default: LU partial pivoting.<br />

⎞<br />

,<br />

⎟<br />

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

Saved successfully!

Ooh no, something went wrong!