相关论文: Stokes, Gibbs and volume computation of semi-algeb…
We describe a practical algorithm for computing the Stokes multipliers of a linear differential equation with polynomial coefficients at an irregular singular point of single level one. The algorithm follows a classical approach based on…
We study the approximation by a semi-discrete finite-volume scheme of the Gross-Pitaevskii equation with time-dependent potential in two dimensions, performing a two-point flux approximation scheme in space. We rigorously analyze the error…
The present work concerns spherical spin glass models with disorder satisfying a uniform logarithmic Sobolev inequality. We show that the Hessian descent algorithm introduced by Subag can be extended to this setting, thanks to the abundance…
This paper studies how to solve semi-infinite polynomial programming (SIPP) problems by semidefinite relaxation method. We first introduce two SDP relaxation methods for solving polynomial optimization problems with finitely many…
We consider the problem of constructing an approximation of the Pareto curve associated with the multiobjective optimization problem $\min_{\mathbf{x} \in \mathbf{S}}\{ (f_1(\mathbf{x}), f_2(\mathbf{x})) \}$, where $f_1$ and $f_2$ are two…
A non-overlapping domain decomposition algorithm is proposed to solve the linear system arising from mixed finite element approximation of incompressible Stokes equations. A continuous finite element space for the pressure is used. In the…
Consider the problem of minimizing an expected logarithmic loss over either the probability simplex or the set of quantum density matrices. This problem includes tasks such as solving the Poisson inverse problem, computing the…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more importantly we provide a unified geometric argument,…
The paper develops and analyzes a higher-order unfitted finite element method for the incompressible Stokes equations, which yields a strongly divergence-free velocity field up to the physical boundary. The method combines an isoparametric…
Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…
Several types of simultaneous approximation term (SAT) for diffusion problems discretized with diagonal-norm multidimensional summation-by-parts (SBP) operators are analyzed based on a common framework. Conditions under which the SBP-SAT…
We consider a fully discrete scheme for nonlinear stochastic partial differential equations with non-globally Lipschitz coefficients driven by multiplicative noise in a multi-dimensional setting. Our method uses a polynomial based spectral…
Sampling-based algorithms are classical approaches to perform Bayesian inference in inverse problems. They provide estimators with the associated credibility intervals to quantify the uncertainty on the estimators. Although these methods…
This work considers the infinite-time discounted optimal control problem for continuous time input-affine polynomial dynamical systems subject to polynomial state and box input constraints. We propose a sequence of sum-of-squares (SOS)…
The low-degree polynomial framework has been highly successful in predicting computational versus statistical gaps for high-dimensional problems in average-case analysis and machine learning. This success has led to the low-degree…
This paper studies a class of so-called linear semi-infinite polynomial programming (LSIPP) problems. It is a subclass of linear semi-infinite programming problems whose constraint functions are polynomials in parameters and index sets are…
This paper studies the sparse Moment-SOS hierarchy of relaxations for solving sparse polynomial optimization problems. We show that this sparse hierarchy is tight if and only if the objective can be written as a sum of sparse nonnegative…
In this article we provide an experimental algorithm that in many cases gives us an upper bound of the global infimum of a real polynomial on $\R^{n}$. It is very well known that to find the global infimum of a real polynomial on $\R^{n}$,…
The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e.,…