--- Job minsurf100 Start 09/21/08 05:44:07 LNX-LX3 22.9.0 x86/Linux GAMS Rev 229 Copyright (C) 1987-2008 GAMS Development. All rights reserved *** ************* ALFA release *** GAMS Base Module ALFA 10Sep08 22.9.0 LNX 6574.6578 LX3 x86/Linux *** ************* ALFA release Licensee: Stefan Vigerske G080908/0001CB-LNX Humboldt University Berlin, Numerical Mathematics DC5918 --- Starting compilation --- minsurf100.gms(15398) 5 Mb --- Starting execution: elapsed 0:00:00.378 --- minsurf100.gms(15394) 6 Mb --- Generating NLP model m --- minsurf100.gms(15398) 13 Mb --- 1 rows 5,305 columns 5,305 non-zeroes --- 339,969 nl-code 5,304 nl-non-zeroes --- minsurf100.gms(15398) 10 Mb --- Executing IPOPT: elapsed 0:00:01.035 GAMS/Ipopt NLP Solver (IPOPT Library 3.5) written by A. Waechter List of user-set options: Name Value used acceptable_tol = 1e-08 yes compl_inf_tol = 0.0001 yes constr_viol_tol = 0.0001 yes linear_solver = mumps yes tol = 1e-08 yes ****************************************************************************** This program contains Ipopt, a library for large-scale nonlinear optimization. Ipopt is released as open source code under the Common Public License (CPL). For more information visit http://projects.coin-or.org/Ipopt ****************************************************************************** This is Ipopt version 3.5stable, running with linear solver mumps. Number of nonzeros in equality constraint Jacobian...: 0 Number of nonzeros in inequality constraint Jacobian.: 0 Number of nonzeros in Lagrangian Hessian.............: 19701 Total number of variables............................: 5000 variables with only lower bounds: 5000 variables with lower and upper bounds: 0 variables with only upper bounds: 0 Total number of equality constraints.................: 0 Total number of inequality constraints...............: 0 inequality constraints with only lower bounds: 0 inequality constraints with lower and upper bounds: 0 inequality constraints with only upper bounds: 0 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 0 2.5821882e+00 0.00e+00 1.02e+00 0.0 0.00e+00 - 0.00e+00 0.00e+00 0 1 2.5736586e+00 0.00e+00 2.42e-02 -6.4 1.04e-02 - 9.77e-01 1.00e+00f 1 2 2.5654556e+00 0.00e+00 3.32e-02 -3.3 1.25e-01 - 8.96e-01 1.00e+00f 1 3 2.5682126e+00 0.00e+00 3.50e-02 -4.1 1.14e-01 - 9.34e-01 1.00e+00f 1 4 2.6544167e+00 0.00e+00 2.76e-02 -4.0 2.47e-01 - 8.97e-01 1.00e+00f 1 5 2.6456292e+00 0.00e+00 6.05e-03 -4.0 5.44e-02 - 1.00e+00 1.00e+00f 1 6 2.6431057e+00 0.00e+00 1.47e-03 -4.0 1.81e-02 - 1.00e+00 1.00e+00f 1 7 2.6422022e+00 0.00e+00 4.35e-04 -4.0 1.83e-02 - 1.00e+00 1.00e+00f 1 8 2.5529743e+00 0.00e+00 2.57e-03 -6.1 2.04e-01 - 1.00e+00 6.25e-01f 1 9 2.5281642e+00 0.00e+00 3.56e-03 -10.7 1.43e-01 - 9.99e-01 4.75e-01f 1 iter objective inf_pr inf_du lg(mu) ||d|| lg(rg) alpha_du alpha_pr ls 10 2.5162714e+00 0.00e+00 3.59e-03 -11.0 9.05e-02 - 1.00e+00 4.81e-01f 1 11 2.5109723e+00 0.00e+00 2.92e-03 -11.0 4.67e-02 - 1.00e+00 4.97e-01f 1 12 2.5085863e+00 0.00e+00 1.93e-03 -11.0 2.24e-02 - 1.00e+00 5.42e-01f 1 13 2.5075601e+00 0.00e+00 1.05e-03 -11.0 1.14e-02 - 1.00e+00 6.09e-01f 1 14 2.5070369e+00 0.00e+00 2.50e-05 -8.2 6.84e-03 - 1.00e+00 9.97e-01f 1 15 2.5069717e+00 0.00e+00 1.64e-06 -8.9 2.08e-03 - 1.00e+00 1.00e+00f 1 16 2.5069549e+00 0.00e+00 2.23e-07 -10.1 1.06e-03 - 1.00e+00 1.00e+00f 1 17 2.5069507e+00 0.00e+00 2.82e-08 -11.0 5.32e-04 - 1.00e+00 1.00e+00f 1 18 2.5069496e+00 0.00e+00 3.53e-09 -11.0 2.65e-04 - 1.00e+00 1.00e+00f 1 Number of Iterations....: 18 (scaled) (unscaled) Objective...............: 2.5069496195526901e+00 2.5069496195526901e+00 Dual infeasibility......: 3.5273411483349726e-09 3.5273411483349726e-09 Constraint violation....: 0.0000000000000000e+00 0.0000000000000000e+00 Complementarity.........: 8.7119046628836035e-10 8.7119046628836035e-10 Overall NLP error.......: 3.5273411483349726e-09 3.5273411483349726e-09 Number of objective function evaluations = 19 Number of objective gradient evaluations = 19 Number of equality constraint evaluations = 0 Number of inequality constraint evaluations = 0 Number of equality constraint Jacobian evaluations = 0 Number of inequality constraint Jacobian evaluations = 0 Number of Lagrangian Hessian evaluations = 18 Total CPU secs in IPOPT (w/o function evaluations) = 0.892 Total CPU secs in NLP function evaluations = 10.649 EXIT: Optimal Solution Found. GAMS/Ipopt finished. --- Restarting execution --- minsurf100.gms(15398) 0 Mb --- Reading solution for model m *** Status: Normal completion --- Job minsurf100.gms Stop 09/21/08 05:44:20 elapsed 0:00:13.836