39,903 research outputs found
The algebraic degree of sparse polynomial optimization
In this paper we study a broad class of polynomial optimization problems
whose constraints and objective functions exhibit sparsity patterns. We give
two characterizations of the number of critical points to these problems, one
as a mixed volume and one as an intersection product on a toric variety. As a
corollary, we obtain a convex geometric interpretation of polar degrees, a
classical invariant of algebraic varieties as well as Euclidean distance
degrees. Furthermore, we prove BKK generality of Lagrange systems in many
instances. Motivated by our result expressing the algebraic degree of sparse
polynomial optimisation problems via Porteus' formula, in the appendix we
answer a related question concerning the degree of sparse determinantal
varieties.Comment: 29 page
Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving
We derive efficient algorithms for coarse approximation of algebraic
hypersurfaces, useful for estimating the distance between an input polynomial
zero set and a given query point. Our methods work best on sparse polynomials
of high degree (in any number of variables) but are nevertheless completely
general. The underlying ideas, which we take the time to describe in an
elementary way, come from tropical geometry. We thus reduce a hard algebraic
problem to high-precision linear optimization, proving new upper and lower
complexity estimates along the way.Comment: 15 pages, 9 figures. Submitted to a conference proceeding
Computing Linear Matrix Representations of Helton-Vinnikov Curves
Helton and Vinnikov showed that every rigidly convex curve in the real plane
bounds a spectrahedron. This leads to the computational problem of explicitly
producing a symmetric (positive definite) linear determinantal representation
for a given curve. We study three approaches to this problem: an algebraic
approach via solving polynomial equations, a geometric approach via contact
curves, and an analytic approach via theta functions. These are explained,
compared, and tested experimentally for low degree instances.Comment: 19 pages, 3 figures, minor revisions; Mathematical Methods in
Systems, Optimization and Control, Birkhauser, Base
Random Sampling in Computational Algebra: Helly Numbers and Violator Spaces
This paper transfers a randomized algorithm, originally used in geometric
optimization, to computational problems in commutative algebra. We show that
Clarkson's sampling algorithm can be applied to two problems in computational
algebra: solving large-scale polynomial systems and finding small generating
sets of graded ideals. The cornerstone of our work is showing that the theory
of violator spaces of G\"artner et al.\ applies to polynomial ideal problems.
To show this, one utilizes a Helly-type result for algebraic varieties. The
resulting algorithms have expected runtime linear in the number of input
polynomials, making the ideas interesting for handling systems with very large
numbers of polynomials, but whose rank in the vector space of polynomials is
small (e.g., when the number of variables and degree is constant).Comment: Minor edits, added two references; results unchange
- …