This is a preview. Log in through your library . Abstract In this paper, we present a new approach to constructing schemes for unconstrained convex minimization, which computes approximate solutions ...
This paper considers non-linear programming models in which randomized solutions are allowed. That is, we consider the minimization of the expected value of a non-linear function subject to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback