E  
eps [Lbfgs] 
The machine precision epsmch generated by the code.

I  
is_constrained [Lbfgs] 
Tells whether the problem is constrained.

iter [Lbfgs] 
The number of current iteration.

M  
max [Lbfgs.C] 
See
Lbfgs.F.max .

max [Lbfgs.F]  max f_df x computes the maximum of the function f given by
f_df .

min [Lbfgs.C] 
See
Lbfgs.F.min .

min [Lbfgs.F]  min f_df x compute the minimum of the function f given by
f_df .

N  
neval [Lbfgs] 
The total number of function and gradient evaluations.

neval_current [Lbfgs] 
The number of function value or gradient evaluations in the
current iteration.

nintervals [Lbfgs] 
The total number of intervals explored in the search of Cauchy
points.

nintervals_current [Lbfgs] 
The number of intervals explored in the search of Cauchy point in
the current iteration.

norm_dir [Lbfgs] 
2norm of the line search direction vector.

normi_grad [Lbfgs] 
The infinity norm of the projected gradient

nskipped_updates [Lbfgs] 
The total number of skipped BFGS updates before the current
iteration.

nupdates [Lbfgs] 
The total number of BFGS updates prior the current iteration.

P  
previous_f [Lbfgs] 
Returns f(x) in the previous iteration.

S  
slope [Lbfgs] 
The slope of the line search function at the current point of line
search.

slope_init [Lbfgs] 
The slope of the line search function at the starting point of the
line search.

T  
time_cauchy [Lbfgs] 
The accumulated time spent on searching for Cauchy points.

time_line_search [Lbfgs] 
The accumulated time spent on line search.

time_subspace_min [Lbfgs] 
The accumulated time spent on subspace minimization.

W  
work [Lbfgs]  work n allocate the work space for a problem of size at most n .
