Related papers: Error Bounds for Polynomial Optimization over the …
We develop polynomial-time heuristic methods to solve unimodular quadratic programs (UQPs) approximately, which are known to be NP-hard. In the UQP framework, we maximize a quadratic function of a vector of complex variables with unit…
Let $S \subseteq \mathbb{R}^n$ be a compact semialgebraic set and let $f$ be a polynomial nonnegative on $S$. Schm\"udgen's Positivstellensatz then states that for any $\eta > 0$, the nonnegativity of $f + \eta$ on $S$ can be certified by…
Quadratic unconstrained binary optimization (QUBO) has become the standard format for optimization using quantum computers, i.e., for both the quantum approximate optimization algorithm (QAOA) and quantum annealing (QA). We present a…
Floating point error is an inevitable drawback of embedded systems implementation. Computing rigorous upper bounds of roundoff errors is absolutely necessary to the validation of critical software. This problem is even more challenging when…
In this research paper, the problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. It is reasoned that under some conditions, the optimum occurs at the corners of…
The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $\mathbb Q[x_1, \dots, x_n]$ to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]$ where $p$ is a prime number; in other words, the…
We propose an approach based on quadratic approximations for solving general Mixed-Integer Nonlinear Programming (MINLP) problems. Specifically, our approach entails the global approximation of the epigraphs of constraint functions by means…
A Bernstein type inequality is obtained for the Jacobi polynomials $P_n^{\alpha,\beta}(x)$, which is uniform for all degrees $n\ge0$, all real $\alpha,\beta\ge0$, and all values $x\in [-1,1]$. It provides uniform bounds on a complete set of…
Recently, Mursaleen et al applied (p,q)-calculus in approximation theory and introduced (p,q)-analogue of Bernstein operators in [16]. In this paper, we construct and introduce a generalization of the bivariate Bleimann-Butzer-Hahn…
This paper considers the finite element solution of the boundary value problem of Poisson's equation and proposes a guaranteed em a posteriori local error estimation based on the hypercircle method. Compared to the existing literature on…
In this paper, we establish hardness and approximation results for various $L_p$-ball constrained homogeneous polynomial optimization problems, where $p \in [2,\infty]$. Specifically, we prove that for any given $d \ge 3$ and $p \in…
We prove an effective density theorem with polynomial error rate for orbits of upper triangular subgroup of $\mathrm{SL}_2(\mathbb{Q}_p)$ in $\mathrm{SL}_2(\mathbb{Q}_p) \times \mathrm{SL}_2(\mathbb{Q}_p)$ for prime number $p > 3$. The…
In this paper, we introduce the higher order generalization of Bernstein type operators defined by (p,q)-integers. We establish some approximation results for these new operators by using the modulus of continuity.
We take advantage of recent and new results on optimal quantization theory to improve the quadratic optimal quantization error bounds for backward stochastic differential equations (BSDE) and nonlinear filtering problems. For both problems,…
For any real numbers $B \ge 1$ and $\delta \in (0, 1)$ and function $f: [0, B] \rightarrow \mathbb{R}$, let $d_{B; \delta} (f) \in \mathbb{Z}_{> 0}$ denote the minimum degree of a polynomial $p(x)$ satisfying $\sup_{x \in [0, B]} \big| p(x)…
We consider the problem of approximating Quadratic O-1 Integer Programs with bounded number of constraints and non-negative constraint matrix entries, which we term as PIQP. We describe and analyze a randomized algorithm based on a program…
We establish optimal $(p,q)$ ranges for two types of estimates associated to three dimensional complex polynomial curves. These are the estimates for the weighted restriction of the Fourier Transform to a complex polynomial curve, and the…
Using higher-order derivative with respect to the parameter, we will give lower bounds for variance of unbiased estimators in quantum estimation problems. This is a quantum version of the Bhattacharyya inequality in the classical…
The $2 \rightarrow q$ norm of a matrix $X \in \mathbb{R}^{n \times d}$ is defined as $\lVert X \rVert_{2 \rightarrow q} = \sup_{\lVert v \rVert_2 = 1} \lVert Xv \rVert_q$. We give polynomial-time multiplicative approximation algorithms for…
Constraints solvers play a significant role in the analysis, synthesis, and formal verification of complex embedded and cyber-physical systems. In this paper, we study the problem of designing a scalable constraints solver for an important…