A systematization of global well-posedness in vector optimization
本文系统梳理了向量优化问题中全局适定性的不同定义，比较了针对有效解、弱有效解和真有效解的全局适定性概念，并给出了标量化刻画，最后研究了向量锥凸函数的全局适定性。
Abstract In this paper we give a systematization of global well-posedness in vector optimization. We investigate the links among global notions of well-posedness for a vector optimization problem (see e.g. Miglierina et al. in J Optim Theory Appl 126:391–409, 2005 for a detailed explanation of the difference between pointwise and global well-posedness in vector optimization). In particular we compare several notions of global well-posedness referring to efficient solutions, weakly efficient solutions and properly efficient solutions of a vector optimization problem. We also establish scalar characterizations of global vector well-posedness. Finally we study global well-posedness of vector cone-convex functions.