shakey % ls #eigenStoch.dat#.~1~ eigenStoch5.dat experiment1000.log cheb5.txt eigenStoch5.dat~ experiment1000.log~ data5.m eigenStoch5v1.dat experiment1000Cheb.log data5.m~ eigenStochChebN.dat experiment1000Cheb.log~ eigenStoch.dat eigenStochChebN.dat~ experimentSmallFinal.log eigenStoch.dat.~1~ eigenStochN.dat mihai.txt eigenStoch.dat.~2~ eigenStochN.dat~ out.txt eigenStoch.dat.~6~ eigenStochN.mod out3.txt eigenStoch.dat.~7~ eigenStochN.mod~ out5.txt eigenStoch.mod ex1000.log stochOutData.m eigenStoch.mod.~1~ ex1000.log~ stochOutData.m~ eigenStoch.mod.~2~ experiment.log stochOutData1.m eigenStoch.mod.~3~ experiment.log~ shakey % ampl ampl: model eigenStochN.mod; ampl: data eigenStochN.dat; ampl: option solver knitro; ampl: solve; KNITRO 5.1.2: ====================================== Commercial License (time limited) KNITRO 5.1.2 Ziena Optimization, Inc. website: www.ziena.com email: info@ziena.com ====================================== KNITRO changing algorithm from AUTO to 1. KNITRO changing bar_murule from AUTO to 1. KNITRO changing bar_initpt from AUTO to 2. KNITRO changing honorbnds to 0 (because there are no bounds). Problem Characteristics ----------------------- Objective goal: Minimize Number of variables: 5000 bounded below: 0 bounded above: 0 bounded below and above: 0 fixed: 0 free: 5000 Number of constraints: 5 linear equalities: 0 nonlinear equalities: 5 linear inequalities: 0 nonlinear inequalities: 0 range: 0 Number of nonzeros in Jacobian: 25000 Number of nonzeros in Hessian: 19995 Iter Objective Feas err Opt err ||Step|| CG its -------- -------------- ---------- ---------- ---------- ------- 0 0.000000e+00 7.071e-01 10 -2.103313e-01 3.418e-03 5.108e-03 2.757e-01 9 19 -2.211166e-01 2.060e-10 9.341e-13 1.691e-05 0 EXIT: LOCALLY OPTIMAL SOLUTION FOUND. Final Statistics ---------------- Final objective value = -2.21116556845785e-01 Final feasibility error (abs / rel) = 2.06e-10 / 2.06e-10 Final optimality error (abs / rel) = 9.34e-13 / 9.34e-13 # of iterations (major / minor) = 19 / 42 # of function evaluations = 79 # of gradient evaluations = 20 # of Hessian evaluations = 19 Total program time (secs) = 9.18496 ( 9.170 CPU time) Time spent in evaluations (secs) = 7.07638 ========================================================================= LOCALLY OPTIMAL SOLUTION FOUND. objective -0.2211165568; feasibility error 2.06e-10 19 major iterations; 79 function evaluations ampl: reset; ampl: model eigenStochN.dat; eigenStochN.dat, line 4 (offset 28): syntax error context: >>> param: <<< RHS := 1 1.4142135624 ampl? model eigenStochN.mod; ampl: data eigenStochChebN.dat; eigenStochChebN.dat, line 1 (offset 6): N was defined in the model context: param >>> N <<< :=1000; eigenStochChebN.dat, line 2 (offset 21): M was defined in the model context: param >>> M <<< :=5; eigenStochChebN.dat, line 4 (offset 39): RHS is not a subscripted param context: param: RHS >>> := <<< 1 1.7724527225 eigenStochChebN.dat, line 10 (offset 162): LL is not a subscripted param context: param: LL >>> := <<< 1 1 1 0.5641892244 1 1 2 -0.0000000005 1 1 3 -0.0000005080 1 1 4 -0.0000000005 1 1 5 -0.0000005080 eigenStochChebN.dat, line 36 (offset 3453): L is not a subscripted param context: param: L >>> := <<< 1 1 -0.0000000007 1 2 0.7071058808 1 3 -0.0000000010 1 4 -0.0000009003 1 5 -0.0000000010 eigenStochChebN.dat, line 42 (offset 4030): syntax error context: let {i in 1..N} >>> x[ <<< 1,i]:=1/sqrt(N); ampl? ; ampl: !ls; syntax error context: >>> !l <<< s; ampl: exec ls syntax error context: exec >>> ls <<< ampl? ' missing ' context: >>> ' <<< ampl? shell ls ampl? ; ampl: reset; ampl: model eigenStochN.mod; ampl: data eigenStochChebN.dat; ampl: option solver knitro; ampl: solve; KNITRO 5.1.2: ====================================== Commercial License (time limited) KNITRO 5.1.2 Ziena Optimization, Inc. website: www.ziena.com email: info@ziena.com ====================================== KNITRO changing algorithm from AUTO to 1. KNITRO changing bar_murule from AUTO to 1. KNITRO changing bar_initpt from AUTO to 2. KNITRO changing honorbnds to 0 (because there are no bounds). Problem Characteristics ----------------------- Objective goal: Minimize Number of variables: 5000 bounded below: 0 bounded above: 0 bounded below and above: 0 fixed: 0 free: 5000 Number of constraints: 5 linear equalities: 0 nonlinear equalities: 5 linear inequalities: 0 nonlinear inequalities: 0 range: 0 Number of nonzeros in Jacobian: 25000 Number of nonzeros in Hessian: 19995 Iter Objective Feas err Opt err ||Step|| CG its -------- -------------- ---------- ---------- ---------- ------- 0 -1.996954e-10 1.208e+00 10 -4.277319e-01 8.635e-03 6.662e-03 5.861e-01 14 20 -4.385670e-01 8.222e-05 2.681e-03 1.557e-01 11 25 -4.396504e-01 1.357e-11 8.341e-14 4.886e-06 0 EXIT: LOCALLY OPTIMAL SOLUTION FOUND. Final Statistics ---------------- Final objective value = -4.39650398401942e-01 Final feasibility error (abs / rel) = 1.36e-11 / 1.12e-11 Final optimality error (abs / rel) = 8.34e-14 / 8.34e-14 # of iterations (major / minor) = 25 / 53 # of function evaluations = 98 # of gradient evaluations = 26 # of Hessian evaluations = 25 Total program time (secs) = 13.98600 ( 14.000 CPU time) Time spent in evaluations (secs) = 11.05249 ========================================================================= LOCALLY OPTIMAL SOLUTION FOUND. objective -0.4396503984; feasibility error 1.36e-11 25 major iterations; 98 function evaluations ampl: