Lines Matching full:rank
161 // The LBFGS hessian approximation is a low rank approximation to
162 // the inverse of the Hessian matrix. The rank of the
164 // complexity of using the approximation. Higher the rank, the
174 // So increasing this rank to a large number will cost time and
177 // maximum rank. The best choice usually requires some problem
