3 citations · 8 across the 12 of their papers we have counts for
13 papers
The charnes--cooper transformation and fractional programs with convex polynomials
Chengmiao Yang, Liguo Jiao, Jae Hyoung Lee
This paper proposes a scheme based on the Charnes--Cooper transformation for solving a class of fractional programs with convex polynomial data. We employ the high-degree perturbat…
First-order SDSOS-convex semi-algebraic optimization and exact SOCP relaxations
Chengmiao Yang, Liguo Jiao, Jae Hyoung Lee
In this paper, we define a new type of nonsmooth convex function, called {\em first-order SDSOS-convex semi-algebraic function}, which is an extension of the previously proposed fi…
SPLD polynomial optimization and bounded degree SOS hierarchies
Liguo Jiao, Jae Hyoung Lee, Nguyen Bui Nguyen Thao
In this paper, we introduce a new class of structured polynomials, called separable plus lower degree (SPLD) polynomials. The formal definition of an SPLD polynomial, which extends…
A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
Chengmiao Yang, Liguo Jiao, Jae Hyoung Lee
In this paper, we study a class of nonsmooth fractional programs {\rm (FP, for short)} with SOS-convex semi-algebraic functions. Under suitable assumptions, we derive a strong dual…
Utopia point method based robust vector polynomial optimization scheme
Tianyi Han, Liguo Jiao, Jae Hyoung Lee +1
In this paper, we focus on a class of robust vector polynomial optimization problems (RVPOP in short) without any convex assumptions. By combining/improving the utopia point method…
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…
Existence of Pareto Solutions for Vector Polynomial Optimization Problems with Constraints
Yarui Duan, Liguo Jiao, Pengcheng Wu +1
In this paper, we are interested in the existence of Pareto solutions to vector polynomial optimization problems over a basic closed semi-algebraic set. By invoking some powerful t…
On Solving a Class of Fractional Semi-infinite Polynomial Programming Problems
Feng Guo, Liguo Jiao
In this paper, we study a class of fractional semi-infinite polynomial programming (FSIPP) problems, in which the objective is a fraction of a convex polynomial and a concave polyn…
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…
Convergence analysis of a proximal-type algorithm for DC programs with applications to variable selection
Shuang Wu, Bui Van Dinh, Liguo Jiao +2
We consider a minimization problem of the form where is a differentiable function and…