On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators

In this paper, we employ the characterization for an approximate convex function in terms of its convexificator to establish the relationships between the solutions of Stampacchia type vector variational inequality problems in terms of convexificator and quasi efficient solution of a nonsmooth vector optimization problems involving locally Lipschitz functions. We identify the vector critical points, the weak quasi efficient points and the solutions of the weak vector variational inequality problem under generalized approximate convexity assumptions. The results of the paper extend, unify and sharpen corresponding results in the literature. In particular, this work extends and generalizes earlier works by Giannessi [11], Upadhyay et al. [31], Osuna-Gomez et al. [30], to a wider class of functions, namely the nonsmooth approximate convex functions and its generalizations. Moreover, this work sharpens earlier work by Daniilidis and Georgiev [5] and Mishra and Upadhyay [23], to a more general class of subdifferentials known as convexificators.

[1]  Vladimir F. Demyanov,et al.  Hunting for a Smaller Convex Subdifferential , 1997, J. Glob. Optim..

[2]  Xiaoqi Yang,et al.  Approximate solutions and optimality conditions of vector variational inequalities in Banach spaces , 2008, J. Glob. Optim..

[3]  Shashi Kant Mishra,et al.  Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency , 2013 .

[4]  Joydeep Dutta,et al.  Convexifactors, generalized convexity and vector optimization , 2004 .

[5]  Vaithilingam Jeyakumar,et al.  Nonsmooth Calculus, Minimality, and Monotonicity of Convexificators , 1999 .

[6]  Kok Lay Teo,et al.  Some Remarks on the Minty Vector Variational Inequality , 2004 .

[7]  J. Dutta,et al.  ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION , 2001 .

[8]  X. Long,et al.  OPTIMALITY CONDITIONS FOR EFFICIENCY ON NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS , 2014 .

[9]  R. Osuna-Gómez,et al.  Invex Functions and Generalized Convexity in Multiobjective Programming , 1998 .

[10]  Sien Deng.  On Approximate Solutions in Convex Vector Optimization , 1997 .

[11]  Aris Daniilidis,et al.  Approximate convexity and submonotonicity , 2004 .

[12]  Do Van Luu,et al.  Convexificators and necessary conditions for efficiency , 2014 .

[13]  X. Li,et al.  Stronger Kuhn-Tucker Type Conditions in Nonsmooth Multiobjective Optimization: Locally Lipschitz Case , 2005 .

[14]  V. Jeyakumar,et al.  Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C 1 -Optimization , 1998 .

[15]  M. Golestani,et al.  Convexificators and strong Kuhn-Tucker conditions , 2012, Comput. Math. Appl..

[16]  Qamrul Hasan Ansari,et al.  Nonsmooth Vector Optimization Problems and Minty Vector Variational Inequalities , 2010 .

[17]  Olvi L. Mangasarian,et al.  Nonlinear Programming , 1969 .

[18]  A. Mehra,et al.  Approximate convexity in vector optimisation , 2006, Bulletin of the Australian Mathematical Society.

[19]  Anjana Gupta,et al.  Optimality via generalized approximate convexity and quasiefficiency , 2013, Optim. Lett..

[20]  Q. H. Ansari,et al.  Generalized Minty Vector Variational-Like Inequalities and Vector Optimization Problems , 2009 .

[21]  Philippe Michel,et al.  A generalized derivative for calm and stable functions , 1992, Differential and Integral Equations.

[22]  A. Mehra,et al.  Two Types of Approximate Saddle Points , 2008 .

[23]  F. Giannessi.  On Minty Variational Principle , 1998 .

[24]  H. Ngai,et al.  Approximately convex functions and approximately monotonic operators , 2007 .