Solvability of a Regular Polynomial Vector Optimization Problem without Convexity
Optimization and Control
2021-01-12 v1
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.
Cite
@article{arxiv.2101.03739,
title = {Solvability of a Regular Polynomial Vector Optimization Problem without Convexity},
author = {Danyang Liu and Rong Hu and Yaping Fang},
journal= {arXiv preprint arXiv:2101.03739},
year = {2021}
}