Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization

DOI10.1007/s11117-014-0285-5zbMath1312.49007MaRDI QIDQ2342964

Hui Huang

Publication date: 30 April 2015

Published in: Positivity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11117-014-0285-5

zbMATH Keywords

Clarke subdifferential; vector optimization problem; cone convex functions; strict Pareto efficiency; strict vector variational inequalities

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

49J40: Variational inequalities

49J52: Nonsmooth analysis

58E35: Variational inequalities (global problems) in infinite-dimensional spaces

Related Items

On variational inequalities using directional convexificators, Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces, Multiobjective variational problems and generalized vector variational-type inequalities

Cites Work

• 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
• On the Dini-Hadamard subdifferential of the difference of two functions
• The directional subdifferential of the difference of two convex functions
• Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
• Optimality conditions for vector optimization problems of a difference of convex mappings
• Optimality conditions for D.C. vector optimization problems under reverse convex constraints
• Generalized Minty vector variational-like inequalities and vector optimization problems
• Approximately convex functions and approximately monotonic operators
• Subdifferential characterization of approximate convexity: The lower semicontinuous case
• On Minty vector variational-like inequality
• New second-order directional derivative and optimality conditions in scalar and vector optimization
• Characterizations of strict local minima and necessary conditions for weak sharp minima
• Sufficient optimality condition for vector optimization problems under D.C. data
• Relationships between vector variational-like inequality and optimization problems
• On approximately star-shaped functions and approximate vector variational inequalities
• Lower and upper ginchev derivatives of vector functions and their applications to multiobjective optimization
• On non-smooth \(\alpha\)-invex functions and vector variational-like inequality
• On difference convexity of locally Lipschitz functions
• Strict Efficiency in Set-Valued Optimization
• A closedness condition and its applications to DC programs with convex constraints
• Simplified optimality conditions for minimizing the difference of vector-valued functions
• Strict efficiency in vector optimization