5 papers
A new scheme for approximating the weakly efficient solution set of vector rational optimization problems
Feng Guo, Liguo Jiao
In this paper, we provide a new scheme for approximating the weakly efficient solution set for a class of vector optimization problems with rational objectives over a feasible set…
On continuous selections of polynomial functions
Feng Guo, Liguo Jiao, Do Sang Kim
A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial.…
On types of KKT points in polynomial optimization
Feng Guo, Do Sang Kim, Liguo Jiao +1
Let be a real polynomial function with variables and be a basic closed semialgebraic set in . In this paper, we are interested in the problem of identifying…
Polynomial mathematical programs with equilibrium constraints and semidefinite programming relaxations
Liguo Jiao, Jae Hyoung Lee, Tien-Son Pham
This paper focuses on the study of a mathematical program with equilibrium constraints, where the objective and the constraint functions are all polynomials. We present a method fo…
Multi-objective convex polynomial optimization and semidefinite programming relaxations
Jae Hyoung Lee, Nithirat Sisarat, Liguo Jiao
This paper aims to find efficient solutions to a multi-objective optimization problem (MP) with convex polynomial data. To this end, a hybrid method, which allows us to transform p…