Existence of Pareto Solutions for Vector Polynomial Optimization Problems with Constraints

DOI10.1007/S10957-022-02068-1MaRDI QIDQ6377744arXivFDO

Authors Y. Duan, Liguo Jiao, Pengcheng Wu, Yuying Zhou

Publication date 15 September 2021

Full work available at URL https://doi.org/10.1007/S10957-022-02068-1

Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Polynomial optimization (90C23) Multi-objective and goal programming (90C29)

arXiv classification

math.OC

Abstract: 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 tools from real semi-algebraic geometry, we first introduce the concept called {it tangency varieties}; then we establish connections of the Palais--Smale condition, Cerami condition, {it M}-tameness, and properness related to the considered problem, in which the condition of Mangasarian--Fromovitz constraint qualification at infinity plays an essential role in deriving these connections. According to the obtained connections, we provide some sufficient conditions for existence of Pareto solutions to the problem in consideration, and we also give some examples to illustrate our main findings.

This page was built for publication: Existence of Pareto Solutions for Vector Polynomial Optimization Problems with Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6377744)