4 papers · 1 filter
Deciding lower-boundedness of polynomials
Nguyen Hong Duc, Vu Trung Hieu
This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.
Univariate representations of solutions to generic polynomial complementarity problems
Vu Trung Hieu, Alfredo Noel Iusem, Paul Hugo Schmölling +1
By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of t…
Unboundedness of the images of set-valued mappings having closed graphs: Application to vector optimization
Vu Trung Hieu, Elisabeth Anna Sophia Köbis, Markus Arthur Köbis +1
In this paper, we propose criteria for unboundedness of the images of set-valued mappings having closed graphs in Euclidean spaces. We focus on mappings whose domains are non-close…
Computing local minimizers in polynomial optimization under genericity conditions
Vu Trung Hieu, Akiko Takeda
In this paper, we focus on computing local minimizers of a multivariate polynomial optimization problem under certain genericity conditions. By using a technique in computer algebr…