Existence of Pareto solutions for vector polynomial optimization problems with constraints
This paper deals with a vector polynomial optimization problem over a basic closed semi-algebraic set. The considered problem is a constrained vector polynomial optimization, i.e., \(\min f(x)\), where \(x\) belongs to \(S\), the set of \(n\)-vectors with positive coordinates, subject to polynomial equalities type restrictions. \(S\) is a closed, semi-algebraic set and the assumption is that \(S\) is unbounded. The authors deal with the Pareto value (VPO), Pareto solution, weak Pareto value and weak Pareto solution and denoted by \(\mathrm{sol(VPO)}\) (resp., \(\mathrm{solw(VPO)}\)) as the set of all Pareto solutions (resp., weak Pareto solutions). In the paper, the existence of Pareto solutions to the constrained vector polynomial optimization problem (VPO) under some conditions is proved. The authors do not need any convexity assumptions in the problem (VPO), and they consider the problem (VPO) over a closed (and unbounded) semi-algebraic set \(S\). They define the concepts concerning the Palais-Smale, Cerami condition and establish some relationships between them (Theorem 4.1). All these concepts play an important role in establishing some sufficient conditions for the existence of Pareto solutions to the problem (VPO). In the article, an example is constructed to show that the assumption on the Mangasarian-Fromovitz constraint qualification at infinity of \(S\) cannot be dropped. Besides, several examples are also designed to illustrate some related terminologies. The results are some sufficient conditions for the existence of Pareto solutions to the problem (VPO). The obtained results improve and extend the existing theorems in the polynomial setting.
- On the existence of Pareto solutions for polynomial vector optimization problems
- Existence of Pareto-optimal solutions to the vector optimization problem with an unbounded feasible set
- Polynomial vector variational inequalities under polynomial constraints and applications
- scientific article; zbMATH DE number 7753348
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- A Frank--Wolfe type theorem for convex polynomial programs
- A Frank-Wolfe type theorem for nondegenerate polynomial programs
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- A semidefinite programming approach for solving multiobjective linear programming
- An existence result for maximizations with respect to cones
- An introduction to vector variational inequalities and some new results
- Approximating Pareto curves using semidefinite relaxations
- Atypical points at infinity and algorithmic detection of the bifurcation locus of real polynomials
- Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Coercive Polynomials and Their Newton Polytopes
- Coercive polynomials: stability, order of growth, and Newton polytopes
- Detecting bifurcation values at infinity of real polynomials
- Existence and boundedness of solutions in infinite-dimensional vector optimization problems
- Existence of efficient and properly efficient solutions to problems of constrained vector optimization
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
- Genericity in polynomial optimization
- Geometric categories and o-minimal structures
- scientific article; zbMATH DE number 45943 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- Multicriteria Optimization
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- On efficient solutions in vector optimization
- On the Closedness of the Linear Image of a Closed Convex Cone
- On the complexity of testing attainment of the optimal value in nonlinear optimization
- On the Existence of Pareto Efficient Points
- On the existence of Pareto solutions for polynomial vector optimization problems
- Polynomial vector variational inequalities under polynomial constraints and applications
- Qualification Conditions in Semialgebraic Programming
- Reaching generalized critical values of a polynomial
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Semidefinite approximations of projections and polynomial images of semialgebraic sets
- Singular Points of Complex Hypersurfaces. (AM-61)
- Solvability of a regular polynomial vector optimization problem without convexity
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- Stability of closedness of closed convex sets under linear mappings
- Theory of multiobjective optimization
- Toward effective detection of the bifurcation locus of real polynomial maps
- Variants of the Ekeland variational principle for a set-valued map involving the Clarke normal cone
- Variational principles for set-valued mappings with applications to multiobjective optimization
- Existence of efficient and properly efficient solutions to problems of constrained vector optimization
- On the existence of Pareto solutions for polynomial vector optimization problems
- Existence of Pareto-optimal solutions to the vector optimization problem with an unbounded feasible set
- Solvability of a regular polynomial vector optimization problem without convexity
- scientific article; zbMATH DE number 7753348 (Why is no real title available?)
- Existence of Pareto Solutions for Vector Polynomial Optimization Problems with Constraints
- Merit function as a tool for vector polynomial optimization over an LMI constraint
- Existence of solutions for a relative regularity/non-regularity polynomial vector optimization problem
- Existence of Robust Optimal Solutions for Uncertain Convex Polynomial Optimization Problems
- Solution existence for a class of nonsmooth robust optimization problems
- Existence of weak Pareto efficient solutions of a multiobjective optimization problem under a closed constraint set
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 Q2082235)
