Related papers: Approximating Nonnegative Polynomials via Spectral…

Numerous interesting properties in nonlinear systems analysis can be written as polynomial optimization problems with nonconvex sum-of-squares problems. To solve those problems efficiently, we propose a sequential approach of local…

The full history recursive multilevel Picard approximation method for semilinear parabolic partial differential equations (PDEs) is the only method which provably overcomes the curse of dimensionality for general time horizons if the…

We introduce polystar bodies: compact starshaped sets whose gauge or radial functions are expressible by polynomials, enabling tractable computations, such as that of intersection bodies. We prove that polystar bodies are uniformly dense in…

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

This work proposes a sampling-based (non-intrusive) approach within the context of low-rank separated representations to tackle the issue of curse-of-dimensionality associated with the solution of models, e.g., PDEs/ODEs, with…

We represent the number of mxn non-negative integer matrices (contingency tables) with prescribed row sums and column sums as the expected value of the permanent of a non-negative random matrix with exponentially distributed entries. We…

This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…

We prove that with "high probability" a random Kostlan polynomial in $n+1$ many variables and of degree $d$ can be approximated by a polynomial of "low degree" without changing the topology of its zero set on the sphere $S^n$. The…

We study best approximation to a given function, in the least square sense on a subset of the unit circle, by polynomials of given degree which are pointwise bounded on the complementary subset. We show that the solution to this problem, as…

This paper explores the geometric structure of the spectrahedral cone, called the symmetry adapted PSD cone, and the symmetry adapted Gram spectrahedron of a symmetric polynomial. In particular, we determine the dimension of the symmetry…

When uncertainty meets costly information gathering, a fundamental question emerges: which data points should we probe to unlock near-optimal solutions? Sparsification of stochastic packing problems addresses this trade-off. The existing…

In 1888 Hilbert showed that every nonnegative homogeneous polynomial with real coefficients of degree $2d$ in $n$ variables is a sum of squares if and only if $d=1$ (quadratic forms), $n=2$ (binary forms) or $(n,d)=(3,2)$ (ternary…

This paper presents an efficient Bayesian framework for solving nonlinear, high-dimensional model calibration problems. It is based on a Variational Bayesian formulation that aims at approximating the exact posterior by means of solving an…

We consider the problem of approximating a subset $M$ of a Hilbert space $X$ by a low-dimensional manifold $M_n$, using samples from $M$. We propose a nonlinear approximation method where $M_n $ is defined as the range of a smooth nonlinear…

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

The concept of sums of nonnegative circuit polynomials (SONC) was recently introduced as a new certificate of nonnegativity especially for sparse polynomials. In this paper, we explore the relationship between nonnegative polynomials and…

For given integers $n$ and $d$, both at least 2, we consider a homogeneous multivariate polynomial $f_d$ of degree $d$ in variables indexed by the edges of the complete graph on $n$ vertices and coefficients depending on cardinalities of…

We address composite optimization problems, which consist in minimizing the sum of a smooth and a merely lower semicontinuous function, without any convexity assumptions. Numerical solutions of these problems can be obtained by proximal…

Let $\{P_n \}_{n\ge0}$ be a sequence of monic orthogonal polynomials with respect to a quasi--definite linear functional $u$ and $\{Q_n \}_{n\ge0}$ a sequence of polynomials defined by $$Q_n(x)=P_n(x)+s_n P_{n-1}(x)+t_n P_{n-2}(x),\quad…

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…