Home | History | Annotate | Download | only in source

Lines Matching full:hessian

300 Hessian matrix's sparsity structure into a collection of
362 Here :math:`H(x)` is some approximation to the Hessian of the
391 Hessian is maintained and used to compute a quasi-Newton step
397 inverse Hessian used to compute a quasi-Newton step [Nocedal]_,
759 corresponding to the Hessian, or in other words, no two parameter
817 The L-BFGS hessian approximation is a low rank approximation to the
818 inverse of the Hessian matrix. The rank of the approximation
827 2. The Hessian approximation is constrained to be positive
841 step, the initial inverse Hessian approximation is taken to be the
844 eigenvalue of the true inverse Hessian can result in improved