Abstract
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.
The first author is supported by the Science and Engineering Research Board (SERB), Department of Science and Technology, India under Early Career Reasearch (ECR) advancement scheme through grant no. ECR/2016/001961.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ansari, Q.H., Lee, G.M.: Nonsmooth vector optimization problems and Minty vector variational inequalities. J. Optim. Theory Appl. 145, 1–16 (2010)
Al-Homidan, S., Ansari, Q.H.: Generalized Minty vector variational like inequalities and vector optimization problems. J. Optim. Theory Appl. 144, 1–11 (2010)
Bhatia, D., Gupta, A., Arora, P.: Optimality via generalized approximate convexity and quasiefficiency. Optim. Lett. 7, 127–135 (2013)
Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley-Interscience, New York (1983)
Daniilidis, A., Georgiev, P.: Approximate convexity and submonotonicity. J. Math. Anal. Appl. 291, 292–301 (2004)
Deng, S.: On approximate solutions in convex vector optimization. SIAM J. Control Optim. 35, 2128–2136 (1997)
Demyanov, V.F.: Convexification and Concavification of Positively Homogeneous Functions by the Same Family of Linear Functions. Report 3.208.802 Universita di Pisa (1994)
Demyanov, V.F., Jeyakumar, V.: Hunting for a smaller convex subdifferential. J. Global Optim. 10, 305–326 (1997)
Dutta, J., Chandra, S.: Convexificators, generalized convexity and vector optimization. Optimization 53, 77–94 (2004)
Dutta, J., Vetrivel, V.: On approximate minima in vector optimization. Numer. Funct. Anal. Optim. 22, 845–859 (2001)
Giannessi, F.: Theorems of the alternative, quadratic programming and complementarily problems. In: Cottle, R.W., Giannessi, F., Lions, J.L. (eds.) Variational Inequalities and Complementarity Problems, pp. 151–186. Wiley, New York (1980)
Giannessi, F.: On Minty variational principle. In: Giannessi, F., Komlósi, S., Rapcsák, T. (eds.) New Trends in Mathematical Programming, pp. 93–99. Kluwer Academic Publishers, Dordrecht, Netherland (1997)
Golestani, M., Nobakhtian, S.: Convexificator and strong Kuhn-Tucker conditions. Comput. Math. Appl. 64, 550–557 (2012)
Gupta, A., Mehra, A., Bhatia, D.: Approximate convexity in vector optimization. Bull. Austral. Math. Soc. 74, 207–218 (2006)
Gupta, D., Mehra, A.: Two types of approximate saddle points. Numer. Funct. Anal. Optim. 29, 532–550 (2008)
Jeyakumar, V., Luc, D.T.: Nonsmooth calculus, minimality, and monotonicity of convexificators. J. Optim. Theory Appl. 101(3), 599–621 (1999)
Jeyakumar, V., Luc, D.T.: Approximate Jacobian matrices for nonsmooth continuous maps and \(C^1\)-optimization. SIAM J. Control Optim. 36, 1815–1832 (1998)
Li, X.F., Zhang, J.Z.: Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: locally Lipschitz case. J. Optim. Theory Appl. 127, 367–388 (2005)
Long, X.J., Huang, N.J.: Optimality conditions for efficiency on nonsmooth multiobjective programming problems. Taiwanese J. Math. 18, 687–699 (2014)
Luu, D.V.: Convexifcators and necessary conditions for efficiency. Optimization 63, 321–335 (2013)
Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill, New York (1969)
Michel, P., Penot, J.P.: A generalized derivative for calm and stable functions. Differ. Integral Equ. 5, 433–454 (1992)
Mishra, S.K., Upadhyay, B.B.: Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency. Positivity 17, 1071–1083 (2013)
Mishra, S.K., Upadhyay, B.B.: Pseudolinear Functions and Optimization. Taylor and Francis (2014)
Upadhyay, B.B., Mohapatra, R.N.: On approximate convex functions and submonotone operators using convexificators. J. Nonlinear Convex Anal. (2018) (submitted)
Mishra, S.K., Wang, S.Y., Lai, K.K.: Generalized Convexity and Vector Optimization. Nonconvex Optimization and Its Applications. Springer, Berlin (2009)
Mordukhovich, B.S., Shao, Y.H.: On nonconvex subdifferential calculus in Banach spaces. J. Convex Anal. 2, 211–227 (1995)
Ngai, H.V., Luc, D.T., Thera, M.: Approximate convex functions. J. Nonlinear Convex Anal. 1, 155–176 (2000)
Ngai, H.V., Penot, J.P.: Approximate convex functions and approximately monotone operators. Nonlinear Anal. 66, 547–564 (2007)
Osuna-Gomez, R., Rufian-Lizana, A., Ruiz-Canales, P.: Invex functions and generalized convexity in multiobjective programming. J. Optim. Theory Appl. 98, 651–661 (1998)
Upadhyay, B.B., Mohapatra, R.N., Mishra, S.K.: On relationships between vector variational inequality and nonsmooth vector optimization problems via strict minimizers. Adv. Nonlinear Var. Inequalities 20, 1–12 (2017)
Yang, X.M., Yang, X.Q., Teo, K.L.: Some remarks on the Minty vector variational inequality. J. Optim. Theory Appl. 121, 193–201 (1994)
Yang, X.Q., Zheng, X.Y.: Approximate solutions and optimality conditions of vector variational inequalities in Banach spaces. J. Glob. Optim. 40, 455–462 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Upadhyay, B.B., Mishra, P., Mohapatra, R.N., Mishra, S.K. (2020). On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators. In: Le Thi, H., Le, H., Pham Dinh, T. (eds) Optimization of Complex Systems: Theory, Models, Algorithms and Applications. WCGO 2019. Advances in Intelligent Systems and Computing, vol 991. Springer, Cham. https://doi.org/10.1007/978-3-030-21803-4_66
Download citation
DOI: https://doi.org/10.1007/978-3-030-21803-4_66
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-21802-7
Online ISBN: 978-3-030-21803-4
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)