Jul 3, 2020 · Given a separation oracle \mathsf{SO} for a convex function f defined on \mathbb{R}^n that has an integral minimizer inside a box with radius R ...
Dec 19, 2022 · Pravin M. Vaidya. 1989. A new algorithm for minimizing convex functions over convex sets. In 30th Annual IEEE Symposium on Foundations of ...
Dec 19, 2022 · For minimizing a general convex function f, strongly polynomial algorithms are hopeless unless f satisfies additional combinatorial properties.
Sep 20, 2022 · Abstract. Given a separation oracleSO for a convex function defined onR that has an integral minimizer inside a box with radius , we show ...
In this work, we study the setting where the minimizer of f is an integral point inside a box with radius1 R = 2poly(n).
Duration: 48:53
Posted: Apr 15, 2021
Posted: Apr 15, 2021
Missing: Rational | Show results with:Rational
[PDF] Stochastic L\-convex Function Minimization - Javad Lavaei
lavaei.ieor.berkeley.edu › S-Conve...
We study an extension of the stochastic submodular minimization problem, namely, the stochastic L\-convex minimization problem.
Sep 27, 2017 · My main question is (I give details about my reflexion below):. If E is a Banach space which is the dual space of a separable space, and ...
This work shows how an approximately shortest vector of certain lattice can be used to reduce the dimension of the problem, and how the oracle complexity of ...
Missing: Rational | Show results with:Rational
