This paper introduces a new class of quasi-Newton algorithms for unconstrained minimization in which no line search is necessary and the inverse Hessian approximations are positive definite. These ...
This is a preview. Log in through your library . Abstract We present a readily implementable algorithm for finding stationary points for locally Lipschitzian functions that are not necessarily convex ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback