# On the Complexity of Computing Critical Points with Gröbner Bases

1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several applications in optimization and in real algebraic geometry. These points are solutions of a highly structured system of multivariate polynomial equations involving maximal minors of a Jacobian matrix. We investigate the complexity of solving this problem by using Gröbner basis algorithms under genericity assumptions on the coefficients of the input polynomials. The main results refine known complexity bounds (which depend on the maximum $D=\max(deg(f_1),\ldots,deg(f_p),deg(q))$) to bounds which depend on the list of degrees $(deg(f_1),\ldots,deg(f_p),deg(q))$: we prove that the Gröbner basis computation can be performed in $\delta^{O(\log(A)/\log(G))}$ arithmetic operations in $\mathbb Q$, where $\delta$ is the algebraic degree of the ideal vanishing on the critical points, and $A$ and $G$ are the arithmetic and geometric average of a multiset constructed from the sequence of degrees. As a by-product, we prove that solving such generic optimization problems with Gröbner bases requires at most $D^{O(n)}$ arithmetic operations in $\mathbb Q$, which meets the best known complexity bound for this problem. Finally, we illustrate these complexity results with experiments, giving evidence that these bounds are relevant for applications.
Type de document :
Article dans une revue
SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2014, 24 (3), pp.1382-1401
Domaine :

https://hal.archives-ouvertes.fr/hal-01017032
Contributeur : Pierre-Jean Spaenlehauer <>
Soumis le : mardi 1 juillet 2014 - 16:23:49
Dernière modification le : jeudi 11 janvier 2018 - 06:23:16

### Identifiants

• HAL Id : hal-01017032, version 1
• ARXIV : 1309.2138

### Citation

Pierre-Jean Spaenlehauer. On the Complexity of Computing Critical Points with Gröbner Bases. SIAM Journal on Optimization, Society for Industrial and Applied Mathematics, 2014, 24 (3), pp.1382-1401. 〈hal-01017032〉

### Métriques

Consultations de la notice