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 ...
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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback