Solving sample problem. (f = 0.0 at the optimal solution.) RUNNING THE L-BFGS-B CODE * * * Machine precision = 2.220D-16 N = 25 M = 5 At X0 0 variables are exactly at the bounds At iterate 0 f= 3.46000D+03 |proj g|= 1.03000D+02 At iterate 1 f= 2.39769D+03 |proj g|= 6.50700D+01 At iterate 2 f= 1.43806D+02 |proj g|= 3.64039D+01 At iterate 3 f= 7.28161D+01 |proj g|= 2.29042D+01 At iterate 4 f= 1.60308D+01 |proj g|= 6.95409D+00 At iterate 5 f= 5.18725D+00 |proj g|= 9.05481D+00 At iterate 6 f= 2.12716D+00 |proj g|= 1.96729D+01 At iterate 7 f= 2.07568D-01 |proj g|= 2.12849D+00 At iterate 8 f= 5.32739D-02 |proj g|= 8.32469D-01 At iterate 9 f= 1.30450D-02 |proj g|= 4.27926D-01 At iterate 10 f= 3.86031D-03 |proj g|= 2.00812D-01 At iterate 11 f= 7.45653D-04 |proj g|= 1.37723D-01 At iterate 12 f= 3.54016D-04 |proj g|= 1.21274D-01 At iterate 13 f= 7.42511D-05 |proj g|= 2.97814D-02 At iterate 14 f= 3.74062D-05 |proj g|= 1.72742D-02 At iterate 15 f= 1.09832D-05 |proj g|= 2.86815D-02 At iterate 16 f= 3.90757D-06 |proj g|= 8.08085D-03 At iterate 17 f= 1.99502D-06 |proj g|= 3.47648D-03 At iterate 18 f= 8.25796D-07 |proj g|= 2.25283D-03 At iterate 19 f= 1.99224D-07 |proj g|= 1.45773D-03 At iterate 20 f= 5.75772D-08 |proj g|= 1.48245D-03 At iterate 21 f= 1.46326D-08 |proj g|= 5.44304D-04 At iterate 22 f= 2.36329D-09 |proj g|= 2.25244D-04 At iterate 23 f= 1.08349D-09 |proj g|= 1.72052D-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.721D-04 1.083D-09 F = 1.083490083518441E-009 CONVERGENCE: REL_REDUCTION_OF_F_<=_FACTR*EPSMCH Cauchy time 1.000E-03 seconds. Subspace minimization time 0.000E+00 seconds. Line search time 0.000E+00 seconds. Total User time 2.000E-03 seconds.