     Solving sample problem (Rosenbrock test fcn).
      (f = 0.0 at the optimal solution.)
           * * *
        RUNNING THE L-BFGS-B CODE
           * * *
Machine precision = 2.22e-16
 N =         25
 M =          5
At X0, 0 variables are exactly at the bounds
At iterate     0, f(x)= 3.46e+03, ||proj grad||_infty = 1.03e+02
At iterate     1, f(x)= 2.40e+03, ||proj grad||_infty = 6.51e+01
At iterate     2, f(x)= 1.44e+02, ||proj grad||_infty = 3.64e+01
At iterate     3, f(x)= 7.28e+01, ||proj grad||_infty = 2.29e+01
At iterate     4, f(x)= 1.60e+01, ||proj grad||_infty = 6.95e+00
At iterate     5, f(x)= 5.19e+00, ||proj grad||_infty = 9.05e+00
At iterate     6, f(x)= 2.13e+00, ||proj grad||_infty = 1.97e+01
At iterate     7, f(x)= 2.08e-01, ||proj grad||_infty = 2.13e+00
At iterate     8, f(x)= 5.33e-02, ||proj grad||_infty = 8.32e-01
At iterate     9, f(x)= 1.30e-02, ||proj grad||_infty = 4.28e-01
At iterate    10, f(x)= 3.86e-03, ||proj grad||_infty = 2.01e-01
At iterate    11, f(x)= 7.46e-04, ||proj grad||_infty = 1.38e-01
At iterate    12, f(x)= 3.54e-04, ||proj grad||_infty = 1.21e-01
At iterate    13, f(x)= 7.43e-05, ||proj grad||_infty = 2.98e-02
At iterate    14, f(x)= 3.74e-05, ||proj grad||_infty = 1.73e-02
At iterate    15, f(x)= 1.10e-05, ||proj grad||_infty = 2.87e-02
At iterate    16, f(x)= 3.91e-06, ||proj grad||_infty = 8.08e-03
At iterate    17, f(x)= 2.00e-06, ||proj grad||_infty = 3.48e-03
At iterate    18, f(x)= 8.26e-07, ||proj grad||_infty = 2.25e-03
At iterate    19, f(x)= 1.99e-07, ||proj grad||_infty = 1.46e-03
At iterate    20, f(x)= 5.76e-08, ||proj grad||_infty = 1.48e-03
At iterate    21, f(x)= 1.46e-08, ||proj grad||_infty = 5.44e-04
At iterate    22, f(x)= 2.36e-09, ||proj grad||_infty = 2.25e-04
At iterate    23, f(x)= 1.08e-09, ||proj grad||_infty = 1.72e-04
           * * * 
Tit   = total number of iterations
Tnf   = total number of function evaluations
Tnint = total number of segments explored during Cauchy searches
Skip  = number of BFGS updates skipped
Nact  = number of active bounds at final generalized Cauchy point
Projg = norm of the final projected gradient
F     = final function value
           * * * 
   N    Tit   Tnf  Tnint  Skip  Nact      Projg        F
   25    23    28    47     0     0     1.72e-04 1.08349e-09
F(x) = 1.083490083e-09
22
Cauchy                time 9.770e-04 seconds.
Subspace minimization time 2.761e-03 seconds.
Line search           time 5.170e-04 seconds.
 Total User time 5.319e-03 seconds.
