Browsing Volume 2017 by Subject "Convex optimization"
Now showing items 1-1 of 1
2017-09-26BuchA randomized method for handling a difficult function in a convex optimization problem, motivated by probabilistic programming We propose a randomized gradient method for the handling of a convex function whose gradient computation is demanding. The method bears a resemblance to the stochastic approximation family. But in contrast to stochastic ...