Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
If the set of minimizers K∗ of f is contained in a box of radius R and satisfies (⋆) all extreme points of K∗ are integral, then there is an algorithm that finds an integral minimizer of f using O(n(n + log(R))) calls to SO and poly(n,log(R)) arithmetic operations, with the numbers occuring in the algorithm having bit ...
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 ...
Jan 7, 2021 · Abstract. Given a separation oracle SO for a convex function f that has an integral minimizer inside a box with radius R, we show how to ...
Mar 21, 2021 · We show how an approximately shortest vector of certain lattice can be used to reduce the dimension of the problem, and how the oracle ...
Dec 19, 2022 · Abstract. Given a separation oracle SO for a convex function f defined on ℝn that has an integral minimizer inside a box with radius R, ...
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 ...
Given a separation oracle SO for a convex function f defined on ℝ ⁿ that has an integral minimizer inside a box with radius R , we show how to find an exact ...
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 ...