Nonsmooth Multiobjective Problems and Generalized Vector Variational Inequalities Using Quasi-Efficiency
Tóm tắt
In this paper, a multiobjective problem with a feasible set defined by inequality, equality and set constraints is considered, where the objective and constraint functions are locally Lipschitz. Here, a generalized Stampacchia vector variational inequality is formulated as a tool to characterize quasi- or weak quasi-efficient points. By using two new classes of generalized convexity functions, under suitable constraint qualifications, the equivalence between Kuhn–Tucker vector critical points, solutions to the multiobjective problem and solutions to the generalized Stampacchia vector variational inequality in both weak and strong forms will be proved.
Tài liệu tham khảo
Giannessi, F.: Theorems of alternative, quadratic programs and complementarity problems. In: Variational Inequalities and Complementarity Problems (Proceedings on International School, Erice, 1978), pp. 151–186. Wiley, Chichester (1980)
Yang, X.: Vector variational inequality and vector pseudolinear optimization. J. Optim. Theory Appl. 95(3), 729–734 (1997)
Mishra, S.K., Wang, S.Y., Lai, K.K.: Generalized Convexity and Vector Optimization, Nonconvex Optimization and Its Applications, vol. 90, 1st edn. Springer, Berlin (2009)
Ngai, H.V., Luc, D.T., Théra, M.: Approximate convex functions. J. Nonlinear Convex Anal. 1(2), 155–176 (2000)
Bagirov, A.M., Ugon, J., Mirzayeva, H.G.: Nonsmooth optimization algorithm for solving clusterwise linear regression problems. J. Optim. Theory Appl. 164(3), 755–780 (2015)
Bagirov, A.M., Gadjiev, N.K.: A monotonous method for unconstrained Lipschitz optimization. In: High Performance Algorithms and Software in Nonlinear Optimization (Ischia, 1997). Applied Optimization, vol. 24, pp. 25–42. Kluwer Academic Publishers, Dordrecht (1998)
Bagirov, A.M.: Continuous subdifferential approximations and their applications. J. Math. Sci. (N. Y.) 115(5), 2567–2609 (2003). (Optimization and related topics, 2)
Bagirov, A.M., Karasözen, B., Sezer, M.: Discrete gradient method: derivative-free method for nonsmooth optimization. J. Optim. Theory Appl. 137(2), 317–334 (2008)
Bagirov, A.M., Ugon, J., Mirzayeva, H.: Nonsmooth nonconvex optimization approach to clusterwise linear regression problems. Eur. J. Oper. Res. 229(1), 132–142 (2013)
Dzyadyk, V.K.: Approximative-iterative method for solving non-linear differential and integral equations. In: Algebraic and Geometric Methods in Mathematical Physics (Kaciveli, 1993). Mathematical Physics Studies, vol. 19, pp. 409–414. Kluwer Academic Publishers, Dordrecht (1996)
Liu, J.: \(\varepsilon \)-Pareto optimality for nondifferentiable multiobjective programming via penalty function. J. Math. Anal. Appl. 198(1), 248–261 (1996)
Yokoyama, K.: Epsilon approximate solutions for multiobjective programming problems. J. Math. Anal. Appl. 203(1), 142–149 (1996)
Deng, S.: On approximate solutions in convex vector optimization. SIAM J. Control Optim. 35(6), 2128–2136 (1997)
Gupta, D., Mehra, A.: Two types of approximate saddle points. Numer. Funct. Anal. Optim. 29(5–6), 532–550 (2008)
Soleimani, B.: Characterization of approximate solutions of vector optimization problems with a variable order structure. J. Optim. Theory Appl. 162(2), 605–632 (2014)
Engau, A., Wiecek, M.M.: Cone characterizations of approximate solutions in real vector optimization. J. Optim. Theory Appl. 134(3), 499–513 (2007)
Müller, J.: Approximative solutions to the bicriterion vehicle routing problem with time windows. Eur. J. Oper. Res. 202(1), 223–231 (2010)
Dutta, J., Vetrivel, V.: On approximate minima in vector optimization. Numer. Funct. Anal. Optim. 22(7–8), 845–859 (2001)
Gupta, A., Mehra, A., Bhatia, D.: Approximate convexity in vector optimisation. Bull. Aust. Math. Soc. 74, 207–218 (2006)
Mishra, S., Upadhyay, B.: Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency. Positivity 17(4), 1071–1083 (2013)
Mishra, S., Laha, V.: A note on the paper approximately star-shaped functions and approximate vector variational inequalities. J. Math. Anal. Appl. 159(2), 554–557 (2013)
Yang, X., Zheng, X.: Approximate solutions and optimality conditions of vector variational inequalities in banach spaces. J. Glob. Optim. 40(1), 455–462 (2008)
Lee, G., Lee, K.: Vector variational inequalities for nondifferentiable convex vector optimization problems. J. Glob. Optim. 32(4), 597–612 (2005)
Ansari, Q., Lee, G.: Nonsmooth vector optimization problems and minty vector variational inequalities. J. Optim. Theory Appl. 145(1), 1–16 (2010)
Crespi, G.P., Ginchev, I., Rocca, M.: Some remarks on the minty vector variational principle. J. Math. Anal. Appl. 345(1), 165–175 (2008)
Clarke, F.H.: Optimization and Nonsmooth Analysis, Classics in Applied Mathematics, vol. 5, 2nd edn. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1990)
Ansari, Q.H., Lalitha, C.S., Mehta, M.: Generalized Convexity, Nonsmooth Variational Inequalities, and Nonsmooth Optimization. CRC Press, Boca Raton, FL (2014)
Golestani, M., Nobakhtian, S.: Nonsmooth multiobjective programming: strong KuhnTucker conditions. Positivity 17(3), 711–732 (2013)
Arana-Jiménez, M., Ruiz-Garzón, G., Rufián-Lizana, A., Hernández-Jiménez, B.: A characterization of pseudoinvexity for the efficiency in non-differentiable multiobjective problems. Duality. Nonlinear Anal. 73(4), 1109–1117 (2010)