Levitin-Polyak well-posedness of constrained vector optimization problems (Q995942)

In this paper, three types of Levitin-Polyak well-posedness and generalized Levitin-Polyak well-posednesses for a general constrained vector optimization problem are introduced. Criteria and characterizations for these types of well-posednesses are given. Relations among these types of well-posedness are investigated. And the convergence of a class of penalty methods under the assumption of a type of generalized Levitin-Polyak well-posedness is considered.