     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.397690e+03, ||proj grad||_infty = 6.506999e+01
At iterate     2, f(x)= 1.438056e+02, ||proj grad||_infty = 3.640391e+01
At iterate     3, f(x)= 7.281608e+01, ||proj grad||_infty = 2.290423e+01
At iterate     4, f(x)= 1.603076e+01, ||proj grad||_infty = 6.954087e+00
At iterate     5, f(x)= 5.187248e+00, ||proj grad||_infty = 9.054805e+00
At iterate     6, f(x)= 2.127160e+00, ||proj grad||_infty = 1.967290e+01
At iterate     7, f(x)= 2.075683e-01, ||proj grad||_infty = 2.128494e+00
At iterate     8, f(x)= 5.327389e-02, ||proj grad||_infty = 8.324690e-01
At iterate     9, f(x)= 1.304501e-02, ||proj grad||_infty = 4.279260e-01
At iterate    10, f(x)= 3.860311e-03, ||proj grad||_infty = 2.008120e-01
At iterate    11, f(x)= 7.456532e-04, ||proj grad||_infty = 1.377226e-01
At iterate    12, f(x)= 3.540162e-04, ||proj grad||_infty = 1.212738e-01
At iterate    13, f(x)= 7.425114e-05, ||proj grad||_infty = 2.978144e-02
At iterate    14, f(x)= 3.740625e-05, ||proj grad||_infty = 1.727422e-02
At iterate    15, f(x)= 1.098318e-05, ||proj grad||_infty = 2.868147e-02
At iterate    16, f(x)= 3.907566e-06, ||proj grad||_infty = 8.080850e-03
At iterate    17, f(x)= 1.995017e-06, ||proj grad||_infty = 3.476480e-03
At iterate    18, f(x)= 8.257964e-07, ||proj grad||_infty = 2.252828e-03
At iterate    19, f(x)= 1.992236e-07, ||proj grad||_infty = 1.457727e-03
At iterate    20, f(x)= 5.757716e-08, ||proj grad||_infty = 1.482452e-03
At iterate    21, f(x)= 1.463259e-08, ||proj grad||_infty = 5.443041e-04
At iterate    22, f(x)= 2.363294e-09, ||proj grad||_infty = 2.252442e-04
At iterate    23, f(x)= 1.083490e-09, ||proj grad||_infty = 1.720523e-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.720523e-04 1.083490e-09
F(x) = 1.083490084e-09
22
Cauchy                time 1.060e-04 seconds.
Subspace minimization time 2.890e-04 seconds.
Line search           time 6.500e-05 seconds.
 Total User time 7.690e-04 seconds.