Convex optimisation constitutes a fundamental area in applied mathematics where the objective is to identify the minimum of a convex function subject to a set of convex constraints. This framework ...
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