ampl: option knitro_options 'maxit=50 eps=1.0e-05';
| OPTION | DESCRIPTION | DEFAULT |
| delta | initial trust region radius | 1.0e0 |
| direct | 0: always use iterative approach (Conjugate-Gradient) to generate steps
1: allow for direct factorization steps |
0 |
| feasible | 0: infeasible version of KNITRO (iterates may be infeasible)
1: feasible version of KNITRO (once a feasible iterate has been found all subsequent iterates remain feasible) |
0 |
| feastol | feasibility termination tolerance | 1.0e-6 |
| hessopt | Hessian (Hessian-vector) computation:
1: compute exact Hessian 2: compute (dense) quasi-Newton BFGS Hessian 3: compute (dense) quasi-Newton SR1 Hessian 4: compute Hessian-vector products using finite differencing |
1 |
| iprint | printing output level:
0: no printing 1: print summary information 2: verbose |
1 |
| liwork | length of integer work array | 10000000 |
| lwork | length of real work array | 5000000 |
| maxit | maximum nuber of iterations allowed | 1000 |
| mu | initial barrier parameter value | 1.0e-1 |
| nout | where to direct output:
6: screen 90: output file 'knitro.out' |
6 |
| opttol | optimality termination tolerance | 1.0e-6 |
| pivot | initial pivot threshold value for matrix factorizations | 1.0e-8 |
| soc | 0: do not allow for second order correction steps
1: allow for second order correction steps |
1 |