-
1
From combinatorial optimization to real algebraic geometry and back
Published 2014-12-01Subjects: Get full text
Article -
2
Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
Published 2012-02-01Get full text
Article -
3
-
4
ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION
Published 2012-12-01Subjects: Get full text
Article -
5
An algebraic perspective on multivariate tight wavelet frames
Published 2013“…Recent advances in real algebraic geometry and in the theory of polynomial optimization are applied to answer some open questions in the theory of multivariate tight wavelet frames whose generators have at least one vanishing moment. …”
Get full text
Get full text
Journal Article -
6
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines
Published 2013-09-01“…Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete (under many-one reduction by polynomial-time Turing machines) for this class. …”
Get full text
Article -
7
Robust nonlinear stability and performance analysis of an F/A-18 aircraft model using sum of squares programming
Published 2013“…The methods presented use the sum of squares decomposition and ideas from real algebraic geometry to represent polynomial non-negativity over closed sets to compute various system properties such as L2 gain, regions of attraction, reachable sets and nonlinear Hankel norm approximations. …”
Journal article -
8
Model validation and robust stability analysis of the bacterial heat shock response using SOSTOOLS
Published 2003“…Combining ideas from robust control theory, real algebraic geometry, optimization and semidefinite programming, SOSTOOLS provides a promising framework to answer these robustness and model validation questions algorithmically. …”
Conference item -
9
A zero-dimensional approach to compute real radicals
Published 2008-04-01“…The notion of real radicals is a fundamental tool in Real Algebraic Geometry. It takes the role of the radical ideal in Complex Algebraic Geometry. …”
Get full text
Article -
10
The Non-Tightness of a Convex Relaxation to Rotation Recovery
Published 2021-11-01“…The methods we use are mostly drawn from the area of polynomial optimization and convex relaxation; we also use some results from real algebraic geometry, as well as Matlab optimization packages for PNP.…”
Get full text
Article -
11
Neural network verification using polynomial optimisation
Published 2022“…We approach the problem from a different perspective, using polynomial optimisation and real algebraic geometry (the Positivstellensatz) to assert the emptiness of a semi-algebraic set. …”
Conference item -
12
Spatial reasoning with augmented points: Extending cardinal directions with local distances
Published 2012-12-01“…We provide a formal specification of EPRAm including a composition table for EPRA2 automatically determined using real algebraic geometry. We also report on an experimental performance analysis of EPRA2 in the context of a topological map-learning task proposed for benchmarking qualitative calculi. …”
Get full text
Article -
13
Coloured noise from stochastic inflows in reaction-diffusion systems
Published 2019“…To identify suitable models we use tools from real algebraic geometry that link the network structure to its dynamical properties. …”
Journal article -
14
Pell’s equation, sum-of-squares and equilibrium measures on a compact set
Published 2023-07-01“…Interestingly, this view point connects orthogonal polynomials, Christoffel functions and equilibrium measures on one side, with sum-of-squares, convex optimization and certificates of positivity in real algebraic geometry on another side.…”
Get full text
Article -
15
Sparse polynomial optimisation for neural network verification
Published 2023“…We approach the problem from a different perspective, using sparse polynomial optimisation theory and Positivstellensatz, a key result in real algebraic geometry. The former exploits the natural cascading structure of the neural network using ideas from chordal sparsity while the latter tests the emptiness of a semi-algebraic set using algebra, to provide tight bounds. …”
Journal article