Related papers: On $\alpha$-minimizing hypercones
Let $D$ be a domain in a finite-dimensional Euclidean space, and $H$ be a convex subcone in the convex cone of all subharmonic functions on $D$. We obtain a criterion for the existence of a lower envelope from $H$ for an arbitrary function…
This article investigates the approximation quality achievable for biobjective minimization problems with respect to the Pareto cone by solutions that are (approximately) optimal with respect to larger ordering cones. When simultaneously…
We generalise Jensen's result on the incompatibility of subcompactness with square. We show that alpha^+-subcompactness of some cardinal less than or equal to alpha precludes square_alpha, but also that square may be forced to hold…
The purpose of this work is to introduce a strategy for determining the nodes and weights of a low-cardinality positive cubature formula nearly exact for polynomials of a given degree over spherical polygons. In the numerical section we…
The polynomial method and the Ambainis's lower bound (or \emph{Alb}, for short) method are two main quantum lower bound techniques. While recently Ambainis showed that the polynomial method is not tight, the present paper aims at studying…
We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…
We present an approach to minimization under constraint. We explore the connections of this technique with the general method of Compactness by Concentration of P.L. Lions and present applications to some constrained semi-linear and…
We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle…
There has been growing interest in high-order tensor methods for nonconvex optimization, with adaptive regularization, as they possess better/optimal worst-case evaluation complexity globally and faster convergence asymptotically. These…
The leading nonperturbative effects to the fine and hyperfine splitting were calculated some time ago. Recently, they have been used in order to obtain realistic numerical results for the lower levels in bottomonium systems. We point out…
We extend the homological method of quantization of generalized Drinfeld--Sokolov reductions to affine superalgebras. This leads, in particular, to a unified representation theory of superconformal algebras.
In this paper, we analyze some theoretical properties of the problem of minimizing a quadratic function with a cubic regularization term, arising in many methods for unconstrained and constrained optimization that have been proposed in the…
We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…
We extend the work of Cremona, Fisher and Stoll on minimising genus one curves of degrees 2,3,4,5, to some of the other representations associated to genus one curves, as studied by Bhargava and Ho. Specifically we describe algorithms for…
This paper proposes a new deterministic sampling strategy for constructing polynomial chaos approximations for expensive physics simulation models. The proposed approach, effectively subsampled quadratures involves sparsely subsampling an…
In this paper, we analyze minimal representations of $(p,\boldsymbol{\alpha})$-power cones as simpler cones. We derive some new results on the complexity of the representations, and we provide a procedure to construct a minimal…
This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we…
This paper shows how to decode errors and erasures with Gabidulin codes in sub-quadratic time in the code length, improving previous algorithms which had at least quadratic complexity. The complexity reduction is achieved by accelerating…
In this paper we introduce a new family of Bernstein-type exponential polynomials on the hypercube $[0, 1]^d$ and study their approximation properties. Such operators fix a multidimensional version of the exponential function and its…
We present a random-subspace variant of cubic regularization algorithm that chooses the size of the subspace adaptively, based on the rank of the projected second derivative matrix. Iteratively, our variant only requires access to…