On quasi ϵ-solution for robust convex optimization problems. - Jae-Hyoung Lee; Liguo Jiao (Optim. Lett., 2017)

Approximate Optimality and Approximate Duality for Quasi Approximate Solutions in Robust Convex Semidefinite Programs. - Liguo Jiao; Jae-Hyoung Lee (J. Optim. Theory Appl., 2018)

Solving Fractional Multicriteria Optimization Problems with Sum of Squares Convex Polynomial Data. - Jae-Hyoung Lee; Liguo Jiao (J. Optim. Theory Appl., 2018)

A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials. - Liguo Jiao; Jae-Hyoung Lee; Yuying Zhou (Oper. Res. Lett., 2020)

Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data. - Liguo Jiao; Jae-Hyoung Lee (Ann. Oper. Res., 2021)

On solving a class of fractional semi-infinite polynomial programming problems. - Feng Guo; Liguo Jiao (Comput. Optim. Appl., 2021)

Multi-objective convex polynomial optimization and semidefinite programming relaxations. - Jae-Hyoung Lee; Nithirat Sisarat; Liguo Jiao (J. Glob. Optim., 2021)

Quasi ε-solutions in a semi-infinite programming problem with locally Lipschitz data. - Liguo Jiao; Do Sang Kim; Yuying Zhou (Optim. Lett., 2021)

Existence of Pareto Solutions for Vector Polynomial Optimization Problems with Constraints. - Yarui Duan; Liguo Jiao; Pengcheng Wu; Yuying Zhou (J. Optim. Theory Appl., 2022)

A new scheme for approximating the weakly efficient solution set of vector rational optimization problems. - Feng Guo; Liguo Jiao (J. Glob. Optim., 2023)

On Types of Isolated KKT Points in Polynomial Optimization. - Feng Guo; Liguo Jiao; Do Sang Kim; Tien-Son Pham (J. Syst. Sci. Complex., 2023)

A utopia point method-based robust vector polynomial optimization scheme. - Tianyi Han; Liguo Jiao; Jae-Hyoung Lee; Junping Yin (J. Glob. Optim., 2024)