Liguo Jiao

From MaRDI portal
Person:262685

Available identifiers

zbMath Open jiao.liguoMaRDI QIDQ262685

List of research outcomes





PublicationDate of PublicationType
Approximate optimality conditions and sensitivity analysis in nearly convex optimization2025-01-17Paper
Fermat's rule at infinity in non-degenerate semi-algebraic optimization2025-01-16Paper
Generalized semi-infinite polynomial optimization and semidefinite programming relaxations2024-12-09Paper
On types of isolated KKT points in polynomial optimization2024-08-29Paper
On continuous selections of polynomial functions2024-02-23Paper
A utopia point method-based robust vector polynomial optimization scheme2024-02-15Paper
On approximate optimality conditions for robust multi-objective convex optimization problems2023-08-14Paper
A new scheme for approximating the weakly efficient solution set of vector rational optimization problems2023-07-26Paper
https://portal.mardi4nfdi.de/entity/Q61338402023-07-24Paper
Optimality Conditions for Approximate Solutions of Nonsmooth Semi-Infinite Vector Optimization Problems2023-07-07Paper
https://portal.mardi4nfdi.de/entity/Q50488262022-11-16Paper
https://portal.mardi4nfdi.de/entity/Q50458502022-11-07Paper
Existence of Pareto solutions for vector polynomial optimization problems with constraints2022-10-04Paper
https://portal.mardi4nfdi.de/entity/Q50152242021-12-06Paper
https://portal.mardi4nfdi.de/entity/Q51651272021-11-15Paper
https://portal.mardi4nfdi.de/entity/Q51604572021-10-28Paper
On solving a class of fractional semi-infinite polynomial programming problems2021-09-29Paper
Existence of Pareto Solutions for Vector Polynomial Optimization Problems with Constraints2021-09-15Paper
Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data2021-07-08Paper
Multi-objective convex polynomial optimization and semidefinite programming relaxations2021-07-07Paper
https://portal.mardi4nfdi.de/entity/Q49880472021-05-11Paper
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data2021-05-05Paper
Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint2021-04-16Paper
https://portal.mardi4nfdi.de/entity/Q49636872021-02-19Paper
https://portal.mardi4nfdi.de/entity/Q51514742021-02-19Paper
On Solving a Class of Fractional Semi-infinite Polynomial Programming Problems2020-08-03Paper
On types of KKT points in polynomial optimization2020-04-26Paper
A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials2020-04-07Paper
Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials2019-12-12Paper
On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems2019-11-20Paper
Polynomial mathematical programs with equilibrium constraints and semidefinite programming relaxations2019-03-22Paper
Solving fractional multicriteria optimization problems with sum of squares convex polynomial data2018-04-13Paper
Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs2018-03-22Paper
On quasi \(\epsilon\)-solution for robust convex optimization problems2017-12-15Paper
Linesearch algorithms for split equilibrium problems and nonexpansive mappings2016-04-06Paper
Optimality and mixed duality in multiobjective \(E\)-convex programming2016-03-30Paper
Optimality conditions in nonconvex semi-infinite multiobjective optimization problems2016-02-26Paper
Higher-order duality in nondifferentiable multiobjective fractional programming involving cones2016-02-12Paper
Convergence Analysis of Algorithms for DC Programming2015-08-16Paper
https://portal.mardi4nfdi.de/entity/Q51778212015-03-06Paper
A parameter-free approach for solving SOS-convex semi-algebraic fractional programsN/APaper

Research outcomes over time

This page was built for person: Liguo Jiao