Related papers: Reducing Isotropy and Volume to KLS: Faster Roundi…
We study quantum algorithms for approximating Lasserre's hierarchy values for polynomial optimization. Let $f,g_1,\ldots,g_m$ be real polynomials in $n$ variables and $f^\star$ the infimum of $f$ over the semialgebraic set $S(g)=\{x:…
Uniform sampling over a convex body is a fundamental algorithmic problem, yet the convergence in KL or R\'enyi divergence of most samplers remains poorly understood. In this work, we propose a constrained proximal sampler, a principled and…
We give a deterministic polynomial space construction for nearly optimal eps-nets with respect to any input n-dimensional convex body K and norm |.|. More precisely, our algorithm can build and iterate over an eps-net of K with respect to…
Given a convex function $f$ on $\mathbb{R}^n$ with an integer minimizer, we show how to find an exact minimizer of $f$ using $O(n^2 \log n)$ calls to a separation oracle and $O(n^4 \log n)$ time. The previous best polynomial time algorithm…
High-order reconstruction schemes for the solution of hyperbolic conservation laws in orthogonal curvilinear coordinates are revised in the finite volume approach. The formulation employs a piecewise polynomial approximation to the…
We present a simple phenomenological formula which approximates the hyperbolic volume of a knot using only a single evaluation of its Jones polynomial at a root of unity. The average error is just $2.86$% on the first $1.7$ million knots,…
We propose a new approach to the computation of the hypervolume indicator, based on partitioning the dominated region into a set of axis-parallel hyperrectangles or boxes. We present a nonincremental algorithm and an incremental algorithm,…
We propose a new primal-dual homotopy smoothing algorithm for a linearly constrained convex program, where neither the primal nor the dual function has to be smooth or strongly convex. The best known iteration complexity solving such a…
Stationary and isotropic iteration stable random tessellations are considered, which can be constructed by a random process of cell division. The collection of maximal polytopes at a fixed time $t$ within a convex window $W\subset{\Bbb…
We overview the volume calculations for polyhedra in Euclidean, spherical and hyperbolic spaces. We prove the Sforza formula for the volume of an arbitrary tetrahedron in $H^3$ and $S^3$. We also present some results, which provide a…
This paper studies the lower bound complexity for the optimization problem whose objective function is the average of $n$ individual smooth convex functions. We consider the algorithm which gets access to gradient and proximal oracle for…
Finite-sum optimization has wide applications in machine learning, covering important problems such as support vector machines, regression, etc. In this paper, we initiate the study of solving finite-sum optimization problems by quantum…
Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…
This paper is concerned with the detection of objects immersed in anisotropic media from boundary measurements. We propose an accurate approach based on the Kohn-Vogelius formulation and the topological sensitivity analysis method. The…
Our main contribution is a concentration inequality for the symmetric volume difference of a $ C^2 $ convex body with positive Gaussian curvature and a circumscribed random polytope with a restricted number of facets, for any probability…
We present and analyze a finite volume scheme of arbitrary order for elliptic equations in the one-dimensional setting. In this scheme, the control volumes are constructed by using the Gauss points in subintervals of the underlying mesh. We…
The problem of minimizing the maximum of $N$ convex, Lipschitz functions plays significant roles in optimization and machine learning. It has a series of results, with the most recent one requiring $O(N\epsilon^{-2/3} + \epsilon^{-8/3})$…
Let W be a compact manifold and let \rho be a representation of its fundamental group into PSL(2,C). The volume of \rho is defined by taking any \rho-equivariant map from the universal cover of W to H^3 and then by integrating the pull-back…
In this paper, we study the fundamental open question of finding the optimal high-order algorithm for solving smooth convex minimization problems. Arjevani et al. (2019) established the lower bound $\Omega\left(\epsilon^{-2/(3p+1)}\right)$…
Let $K$ be a convex body in $\mathbb{R}^{3}$. We denote the volume of $K$ by $Vol(K)$ and the diameter of $K$ by $Diam(K).$ In this paper we prove that there exists a linear bijection $T:\mathbb{R}^{3}\to \mathbb{R}^{3}$ such that…