Related papers: Computing Certificates in Archimedean Univariate S…
In (Davis and Papp, 2022), the authors introduced the concept of dual certificates of (weighted) sum-of-squares polynomials, which are vectors from the dual cone of weighted sums of squares (WSOS) polynomials that can be interpreted as…
We build a class of polynomial problems with not polynomial certificates. The parameter concerning which are defined efficiency of corresponding algorithms is the number $n$ of elements of the set has used at construction of combinatory…
We study $\textit{sparse singular value certificates}$ for random rectangular matrices. If $M$ is an $n \times d$ matrix with independent Gaussian entries, we give a new family of polynomial-time algorithms which can certify upper bounds on…
We deploy numerical semidefinite programming and conversion to exact rational inequalities to certify that for a positive semidefinite input polynomial or rational function, any representation as a fraction of sums-of-squares of polynomials…
Quantum optimal control plays a crucial role in the development of quantum technologies, particularly in the design and implementation of fast and accurate gates for quantum computing. Here, we present a method to synthesize gates using the…
Barrier certificates, serving as differential invariants that witness system safety, play a crucial role in the verification of cyber-physical systems (CPS). Prevailing computational methods for synthesizing barrier certificates are based…
The truncated moment problem consists of determining whether a given finitedimensional vector of real numbers y is obtained by integrating a basis of the vector space of polynomials of bounded degree with respect to a non-negative measure…
Proof certificates can be used to validate the correctness of algebraic derivations. However, in practice, we frequently observed that the exact same proof steps are repeated for different sets of variables, which leads to unnecessarily…
We look for algebraic certificates of positivity for functions which are not necessarily polynomial functions. Similar questions were examined earlier by Lasserre and Putinar and by Putinar. We explain how these results can be understood as…
Certificates to a linear algebra computation are additional data structures for each output, which can be used by a---possibly randomized---verification algorithm that proves the correctness of each output. The certificates are essentially…
Smale's alpha-theory certifies that Newton iterations will converge quadratically to a solution of a square system of analytic functions based on the Newton residual and all higher order derivatives at the given point. Shub and Smale…
This paper introduces and develops the algebraic framework of moment polynomials, which are polynomial expressions in commuting variables and their formal mixed moments. Their positivity and optimization over probability measures supported…
Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear…
In numerical algebraic geometry witness sets are numerical representations of positive dimensional solution sets of polynomial systems. Considering the asymptotics of witness sets we propose certificates for algebraic curves. These…
We consider numerical certification of approximate solutions to a system of polynomial equations with more equations than unknowns by first certifying solutions to a square subsystem. We give several approaches that certifiably select which…
Many works in convex optimization provide rates for achieving a small primal gap. However, this quantity is typically unavailable in practice. In this work, we show that solving a regularized surrogate with algorithms based on simple…
Self-assembly is a fundamental process by which supramolecular species form spontaneously from their components. This process is ubiquitous throughout the life chemistry and is central to biological information processing. Algorithms for…
Various techniques have been used in recent years for verifying quantum computers, that is, for determining whether a quantum computer/system satisfies a given formal specification of correctness. Barrier certificates are a recent novel…
This paper is about solving polynomial systems. It first recalls how to do that efficiently with a very high probability of correctness by reconstructing a rational univariate representation (rur) using Groebner revlex computation,…
In this paper we present a simple technique to derive certificates of non-realizability for an abstract polytopal sphere. Our approach uses a variant of the classical algebraic certificates introduced by Bokowski and Sturmfels in…