On vector variational inequalities and vector optimization problems using strongly convex function
摘要
This paper considers nonsmooth vector optimization problems (NVOP), and investigates the relationships between Minty and Stampacchia vector variational inequality (VVI) problems in terms of convexificators, and develops an efficient minimizer for the (NVOP) by means of a strongly convex function. Additionally, the study examines weak versions of the Stampacchia and Minty VVI problems in aspects of convexificators, elucidating the link between their solutions and the strict minimizer of considered (NVOP). The study enhances and extends specific earlier outcomes from the existing literature.