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

DOI10.1007/978-3-030-21803-4_66zbMath1429.90084OpenAlexW2950607342MaRDI QIDQ5214425

Priyanka Mishra, B. B. Upadhyay, Shashi Kant Mishra, Ram N. Mohapatra

Publication date: 7 February 2020

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-21803-4_66

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (2)

A study on vector variational-like inequalities using convexificators and application to its bi-level form ⋮ On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency
• Optimality conditions for efficiency on nonsmooth multiobjective programming problems
• Generalized convexity and vector optimization.
• Convexificators and strong Kuhn-Tucker conditions
• Some remarks on the Minty vector variational inequality
• Generalized Minty vector variational-like inequalities and vector optimization problems
• Stronger Kuhn-Tucker type conditions in nonsmooth multiobjective optimization: Locally Lipschitz case
• Approximately convex functions and approximately monotonic operators
• Nonsmooth vector optimization problems and Minty vector variational inequalities
• A generalized derivative for calm and stable functions
• Invex functions and generalized convexity in multiobjective programming
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Hunting for a smaller convex subdifferential
• Approximate convexity and submonotonicity.
• Optimality via generalized approximate convexity and quasiefficiency
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• Approximate convexity in vector optimisation
• Two Types of Approximate Saddle Points
• Optimization and nonsmooth analysis
• Approximate Jacobian Matrices for Nonsmooth Continuous Maps and C¹-Optimization
• On Approximate Solutions in Convex Vector Optimization
• Convexifactors, generalized convexity and vector optimization
• Convexificators and necessary conditions for efficiency

This page was built for publication: On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators