Existence of Pareto solutions for vector polynomial optimization problems with constraints

DOI10.1007/s10957-022-02068-1OpenAlexW3201294276MaRDI QIDQ2082235

Pengcheng Wu, Liguo Jiao, Yarui Duan, Yu Ying Zhou

Publication date: 4 October 2022

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.07304

zbMATH Keywords

vector optimizationPalais-Smale conditionpropernesspolynomial optimizationPareto solutionsCerami condition

Mathematics Subject Classification ID

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

Uses Software

• ParetoImageSDP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to vector variational inequalities and some new results
• A Frank-Wolfe type theorem for nondegenerate polynomial programs
• Existence and boundedness of solutions in infinite-dimensional vector optimization problems
• A semidefinite programming approach for solving multiobjective linear programming
• An existence result for maximizations with respect to cones
• Variants of the Ekeland variational principle for a set-valued map involving the Clarke normal cone
• Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
• Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization
• Theory of multiobjective optimization
• Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
• On efficient solutions in vector optimization
• A Frank--Wolfe type theorem for convex polynomial programs
• Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
• Approximating Pareto curves using semidefinite relaxations
• Geometric categories and o-minimal structures
• A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
• Multi-objective convex polynomial optimization and semidefinite programming relaxations
• Atypical points at infinity and algorithmic detection of the bifurcation locus of real polynomials
• On the complexity of testing attainment of the optimal value in nonlinear optimization
• Existence of efficient and properly efficient solutions to problems of constrained vector optimization
• Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials
• On the existence of Pareto solutions for polynomial vector optimization problems
• Toward effective detection of the bifurcation locus of real polynomial maps
• Detecting bifurcation values at infinity of real polynomials
• Reaching generalized critical values of a polynomial
• Polynomial Vector Variational Inequalities under Polynomial Constraints and Applications
• Genericity in Polynomial Optimization
• Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
• On Cone-Efficiency, Cone-Convexity and Cone-Compactness
• Qualification Conditions in Semialgebraic Programming
• Coercive polynomials: stability, order of growth, and Newton polytopes
• On the Existence of Pareto Efficient Points
• Multicriteria Optimization
• On the Closedness of the Linear Image of a Closed Convex Cone
• Coercive Polynomials and Their Newton Polytopes
• Singular Points of Complex Hypersurfaces. (AM-61)
• Solvability of a regular polynomial vector optimization problem without convexity

This page was built for publication: Existence of Pareto solutions for vector polynomial optimization problems with constraints