Solvability of a Regular Polynomial Vector Optimization Problem without Convexity

DOI10.1080/02331934.2021.1990285MaRDI QIDQ6357984arXivFDO

Authors Danyang Liu, Rong Hu, Ya Ping Fang

Publication date 11 January 2021

Published in arXiv

Full work available at URL https://doi.org/10.1080/02331934.2021.1990285

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Polynomial optimization (90C23) Multi-objective and goal programming (90C29)

arXiv classification

math.OC

Abstract: In this paper we consider the solvability of a non-convex regular polynomial vector optimization problem on a nonempty closed set. We introduce regularity conditions for the polynomial vector optimization problem and study properties and characterizations of the regularity conditions. Under the regularity conditions, we study nonemptiness and boundedness of the solution sets of the problem. As a consequence, we establish two Frank-Wolfe type theorems for the non-convex polynomial vector optimization problem. Finally, we investigate the solution stability of the non-convex regular polynomial vector optimization problem.

This page was built for publication: Solvability of a Regular Polynomial Vector Optimization Problem without Convexity

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