-
Unconstraint global polynomial optimization via Gradient Ideal
In this paper, we describe a new method to compute the minimum of a real polynomial function and the ideal defining the points which minimize this polynomial function,... -
Semidefinite programming in combinatorial optimization with applications to c...
We apply the semidefinite programming method to obtain a new upper bound on the cardinality of codes made of subspaces of a linear vector space over a finite field....
