Therefore, a line-search algorithm is an iterative process that optimizes a nonlinear function of one parameter () within each iteration k of the optimization technique, which itself tries to optimize ...

However, if the computation of the Hessian matrix is computationally expensive, one of the (dual) quasi-Newton or conjugate gradient algorithms may be more efficient. Newton-Raphson Optimization with ...