RUNNING THE L-BFGS-B CODE

it    = iteration number
nf    = number of function evaluations
nseg  = number of segments explored during the Cauchy search
nact  = number of active bounds at the generalized Cauchy point
sub   = manner in which the subspace minimization terminated:
        con = converged, bnd = a bound was reached
itls  = number of iterations performed in the line search
stepl = step length used
tstep = norm of the displacement (total step)
projg = norm of the projected gradient
f     = function value

           * * *

Machine precision = 2.220D-16
 N =       109296     M =            5

   it   nf  nseg  nact  sub  itls  stepl    tstep     projg        f
    0    1     -     -   -     -     -        -     1.000D+00  3.254D+03
    1    2    29    28  ---    0  1.8D-01  1.0D+00  8.189D-01  2.059D+03
    2    3     2     1  con    0  1.0D+00  4.1D+00  5.261D+01  4.447D+01
    3    4     1     0  con    0  1.0D+00  2.8D-02  3.823D+01  4.404D+01
    4    5     1     0  con    0  1.0D+00  7.3D-02  8.137D+00  4.322D+01
    5    6     1     0  con    0  1.0D+00  2.8D-02  5.956D+00  4.295D+01
    6    7     1     0  con    0  1.0D+00  6.1D-02  2.869D+00  4.257D+01
    7    8     1     0  con    0  1.0D+00  7.3D-02  2.842D+00  4.223D+01
    8    9     1     0  bnd    0  1.0D+00  7.0D-02  2.813D+00  4.197D+01