On variational inequalities using directional convexificators

References

• Demyanov VF. Convexification and concavification of a positively homogenous function by the same family of linear functions. Universita di Pisa; 1994. (Report 3, 208, 802).
   Google Scholar
• Demayanov VF, Rubinov AM. Quasidifferentiability and related topics. Dordrecht: Kluwer Academic Publishers; 2000.
   Google Scholar
• Demyanov VF, Rubinov AM. Constructive non-smooth analysis. Frankfurt: Peter Lang Verlag; 1995.
   Google Scholar
• Jeakumar V, Luc DT. Nonsmooth calculus, minimality, and monotonicity of convexificators. J Optim Theor Appl. 1999;101:599–621.
   Web of Science ®Google Scholar
• Dempe S, Pilecka M. Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming. J Global Optim. 2015;61:769–788.
   Web of Science ®Google Scholar
• Dutta J, Chandra S. Convexifactors, generalized convexity and vector optimization. Optimization. 2004;53:77–94.
   Web of Science ®Google Scholar
• Gadhi N, El idrissi M, Hamdaoui K. Sufficient optimality conditions and duality results for a bilevel multiobjective optimization problem via a Ψ-reformulation. Optimization. 2020;69: Available from: https://doi.org/10.1080/02331934.2019.1625901.
   Google Scholar
• Kabgani A, Soleimani-damaneh M. Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators. Optim. 2018;67:217–235.
   Web of Science ®Google Scholar
• Kabgani A, Soleimani-damaneh M. The relationships between convexificators and Greenberg-Pierskalla subdifferentials for quasiconvex functions. Numer Funct Anal Optim. 2017;38:1548–1563.
   Web of Science ®Google Scholar
• Lafhim L, Gadhi N, Hamdaoui K, Rahou F. Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation. Optim. 2018;67:1–11.
   PubMed Web of Science ®Google Scholar
• Luu KV. Convexificators and necessary conditions for efficiency. Optimization. 2014;63:321–335.
   Web of Science ®Google Scholar
• Pandey Y, Mishra SK. Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators. Ann Oper Res. 2018;269:549–564.
   Web of Science ®Google Scholar
• Gadhi N, Rahou F, El idrissi M, Lafhim L. Optimality conditions of a set valued optimization problem with the help of directional convexificators. Optimization. 2020; Available from: https://doi.org/10.1080/02331934.2020.1725512.
   Google Scholar
• Stampacchia G. Formes bilinéaires coercives sur les ensembles convexes. C R Acad Sci Paris. 1960;258:4413–4416.
   Google Scholar
• Kinderlehrer D, Stampacchia G. An introduction to variational inequalities and their applications. New York: Academic Press; 1980.
   Google Scholar
• Giammessi F. On Minty variational principle. New trends in mathematical programming. Kluwer; 1997.
   Google Scholar
• Komlósi S. On the Stampacchia and Minty variational inequalities. In: Giorgi G, Rossi FA, editors, Generalized convexity and optimization for economic and financial decisions. Bologna: Pitagora; 1998.
   Google Scholar
• Ansari QH, Lee GM. Nonsmooth vector optimization problems and minty vector variational inequalities. J Optim Theory Appl. 2010;145:1–16.
   Web of Science ®Google Scholar
• Crespi GP, Ginchev I, Rocca M. A note on minty type vector variational inequalities. RAIRO Oper Res. 2005;39:253–273.
   Web of Science ®Google Scholar
• Fang YP, Hu R. A non-smooth version of minty variational principle. Optim. 2009;58:401–412.
   Web of Science ®Google Scholar
• Gupta P, Mishra SK. On minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity. Optimization. 2018;67:1157–1167.
   Web of Science ®Google Scholar
• Huang H. Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization. Positivity. 2015;19:95–109.
   Web of Science ®Google Scholar
• Laha V, Al-Shamary B, Mishra SK. On nonsmooth V-invexity and vector variational-like inequalities in terms of the Michel-Penot subdifferentials. Optim Lett. 2014;8:1675–1690.
   Web of Science ®Google Scholar
• Mishra SK, Laha V. On minty variational principle for nonsmooth vector optimization problems with approximate convexity. Optim Lett. 2016;10:577–589.
   Web of Science ®Google Scholar
• Hiriart-Urruty J-B, Lemarechal C. Fundamentals of convex analysis. Berlin Heidelberg: Springer-Verlag; 2001.
   Google Scholar