Optimized Gröbner basis algorithms for maximal determinantal ideals and critical point computations
This paper gives a new algorithm to compute Gröbner bases of maximal minors of matrices of polynomials, and applies this algorithm to compute the critical points of a polynomial restricted to an algebraic variety. A complexity analysis of this new algorithm is also given.