Abstract

In this paper, vector variational inequalities (VVI) with matrix inequality constraints are investigated by using the image space analysis. Linear separation for VVI with matrix inequality constraints is characterized by using the saddle-point conditions of the Lagrangian function. Lagrangian-type necessary and sufficient optimality conditions for VVI with matrix inequality constraints are derived by utilizing the separation theorem. Gap functions for VVI with matrix inequality constraints and weak sharp minimum property for the solutions set of VVI with matrix inequality constraints are also considered. The results obtained above are applied to investigate the Lagrangian-type necessary and sufficient optimality conditions for vector linear semidefinite programming problems as well as VVI with convex quadratic inequality constraints.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call