1 2---- Minimum Surface Area Problem ----- 3mx:4, my:4 4 0 TAO, Function value: 0.210375, Residual: 0.403597 5 1 TAO, Function value: 0.0110611, Residual: 0.0197949 6 2 TAO, Function value: 4.46353e-05, Residual: 8.72583e-05 7 3 TAO, Function value: 8.12611e-10, Residual: 1.80227e-09 8Tao Object: 1 MPI process 9 type: ssfls 10 TaoLineSearch Object: 1 MPI process 11 type: armijo 12 Armijo linesearch (projected) : alpha=1. beta=0.5 sigma=0.0001 memsize=1 13 maximum function evaluations=30 14 tolerances: ftol=0.0001, rtol=1e-10, gtol=0.9 15 total number of function evaluations=1 16 total number of gradient evaluations=1 17 total number of function/gradient evaluations=0 18 using variable bounds 19 Termination reason: 1 20 KSP Object: 1 MPI process 21 type: gmres 22 restart=30, using Classical (unmodified) Gram-Schmidt Orthogonalization with no iterative refinement 23 happy breakdown tolerance 1e-30 24 maximum iterations=10000, initial guess is zero 25 tolerances: relative=1e-05, absolute=1e-50, divergence=10000. 26 left preconditioning 27 using PRECONDITIONED norm type for convergence test 28 PC Object: 1 MPI process 29 type: ilu 30 out-of-place factorization 31 0 levels of fill 32 tolerance for zero pivot 2.22045e-14 33 matrix ordering: natural 34 factor fill ratio given 1., needed 1. 35 Factored matrix follows: 36 Mat Object: 1 MPI process 37 type: seqaij 38 rows=16, cols=16 39 package used to perform factorization: petsc 40 total: nonzeros=82, allocated nonzeros=82 41 not using I-node routines 42 linear system matrix = precond matrix: 43 Mat Object: 1 MPI process 44 type: seqaij 45 rows=16, cols=16 46 total: nonzeros=82, allocated nonzeros=112 47 total number of mallocs used during MatSetValues calls=0 48 not using I-node routines 49 total KSP iterations: 13 50 Active Set subset type: subvec 51 convergence tolerances: gatol=1e-16, steptol=0., gttol=1e-05 52 Residual in Function/Gradient:=1.80227e-09 53 convergence tolerances: catol=1e-08, crtol=1e-08 54 Residual in Constraints:=0. 55 convergence tolerances: function minimum=1e-08 56 Objective value=8.12611e-10 57 total number of iterations=3, (max: 2000) 58 total number of constraint function evaluations=7 59 total number of Jacobian evaluations=4 60 Solution converged: Minf -- f < fmin 61