DONLP2 with AMPL
This directory contains the DONLP2 executable for ********************* * Intel/Linux 32bit * ********************* This executable works together with the respective AMPL student binary "sampl" which is included for convenience here. In this the maximum number of variables and constraints is limited to 300. This means that the total number of bounds and general constraints is <= 300 for DONLP2.The directory
- donlp2.gz is the gzip compressed binary of donlp2 with the ampl interface in the student's version.
- sampl.gz is the students ampl gzip compressed binary.
- donlp2_options describes the options for the solver, see also below.
- models is a subdirectory with many examples coded in ampl.
- test is a directory with a standard test for donlp2 with results.
- results is the directory with the results from the examples in the models directory.
- amplbook chapter1 is chapter one from the AMPL textbook showing how to work with ampl respectively with sampl.
models contains AMPL models for some well known nonlinear optimization problems. They may be used as examples how to code a model in AMPL.
To use sampl with donlp2 one may proceed in two ways:
Either one writes the sequence of ampl-commands in a file file.mod and invokes
sampl [options] file.mod
with prior exporting of the environment variable
export OPTIONS_IN=filename ; (in the ksh)
or
setenv options donlp2_options "<....your desired settings>" ( in csh)
or one invokes
sampl -
and then types commands interactively.
for example this:
model {filename with .mod extension: the ampl coded problem} ;
option solver donlp2;
option donlp2_options 'tau0=1.e4 silent=0 del0=1.0 outlev=1 wantsol=7';
solve;
display {AMPL variables you want to see, if not in the output} ;
quit;
don't forget the semicolon !!!
In order to use DONLP2 with sampl the options to be set are
option solver donlp2;
option donlp2_options ".....your desired settings";
donlp2_options are the following:
| maxfwd | max vars in fwd automatic differentiation of common exprs (default 5) |
| tau0 | sum of constraint violations allowed during iteration (default 1.d0) |
| del0 | initially an inequality g is binding if g/max{1,||grad g||}<=del0 (defa ult 1.d0) |
| epsx | required precision in primal solution (default 0.00001) |
| maxit | iteration limit (<= 4000) |
| nreset | allowed number of successive steps with insignificant changes in x or f |
| intakt | write iteration protocol also to stdout =0 off (default) =1 on |
| silent | write results and messages on special events to file *.pro and *.mes (d efault =1: no) |
| outlev | composed from 4 bits: bit 1 ="0" means no output , "1" one line per step, bit 2 ="1" short iteration protocol bit 3 ="1" detailed iteration protocol (primal and dual sol's, stepsize s etc.) bit 4 ="1" print also gradients and hessian estimate |
| prou | unit number for output protocol |
| meu | unit number for special events messages protocol |
| wantsol | solution report without -AMPL: 4 bit integer namely sum of 1 ==> write .sol file 2 ==> print primal variable values 4 ==> print dual variable values 8 ==> do not print solution message |
| 0 | Success! KKT conditions satisfied |
| 100 | nearly feasible with small directional deriv. |
| 101 | relaxed KKT conditions satisfied: singular point |
| 110 | small QP correction: nearly feasible and singular |
| 200 | tiny correction from QP at infeasible point |
| 400 | reached maxit steps |
| 500 | N too large (the Fortran donlp2 routines must be recompiled) |
| 501 | unknown termination reason |
| 510 | cannot evaluate constraints |
| 511 | cannot evaluate objective |
| 520 | dual extended QP failure: singular working set |
| 521 | infeasible QP (theoretically impossible) |
| 522 | no descent in QP (theoretically impossible) |
| 523 | tiny QP step from infeasible point |
| 524 | nondescent direction from QP |
| 525 | no acceptable step size |
| 527 | tiny step |
| 528 | more than NRESET small primal corrections |
| 529 | max(N,10) small penalty function differences |
| 540 | slow primal progress: singular or ill-conditioned problem? |
|
|
|
|
|