On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Polar varieties, real equation solving, and data structures: the hypersurface case
Journal of Complexity
A Gröbner free alternative for polynomial system solving
Journal of Complexity
Real solving for positive dimensional systems
Journal of Symbolic Computation
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5)
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
Computational Complexity
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
The Voronoi Diagram of Three Lines
Discrete & Computational Geometry - 23rd Annual Symposium on Computational Geometry
Variant real quantifier elimination: algorithm and application
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Algebraic Degree of Polynomial Optimization
SIAM Journal on Optimization
On the geometry of polar varieties
Applicable Algebra in Engineering, Communication and Computing
Generalized polar varieties: geometry and algorithms
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Critical point methods and effective real algebraic geometry: new results and trends
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points appear naturally in non-convex polynomial optimization which occurs in a wide range of scientific applications (control theory, chemistry, economics,...). Critical points also play a central role in recent algorithms of effective real algebraic geometry. Experimentally, it has been observed that Gröbner basis algorithms are efficient to compute such points. Therefore, recent software based on the so-called Critical Point Method are built on Gröbner bases engines. Let f1,..., fp be polynomials in Q[x1,...,xn] of degree D, V ⊂ Cn be their complex variety and π1 be the projection map (x1,...,xn) - x1. The critical points of the restriction of π1 to V are defined by the vanishing of f1,...,fp and some maximal minors of the Jacobian matrix associated to f1,...,fp. Such a system is algebraically structured: the ideal it generates is the sum of a determinantal ideal and the ideal generated by f1,...,fp. We provide the first complexity estimates on the computation of Gröbner bases of such systems defining critical points. We prove that under genericity assumptions on f1,...,fp, the complexity is polynomial in the generic number of critical points, i.e. Dp(D - 1)n−p(n-1/p-1). More particularly, in the quadratic case D = 2, the complexity of such a Gröbner basis computation is polynomial in the number of variables n and exponential in p. We also give experimental evidence supporting these theoretical results.