A Minty variational principle for set optimization

DOI10.1016/j.jmaa.2014.10.010zbMath1301.49022arXiv1403.2898OpenAlexW2007618062MaRDI QIDQ465450

Carola Schrage, Andreas H. Hamel, Giovanni Paolo Crespi

Publication date: 31 October 2014

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.2898

zbMATH Keywords

generalized convexityset optimizationDini derivativeresiduationMinty-type variational inequalities

Mathematics Subject Classification ID

Variational inequalities (49J40) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)

Related Items (6)

Applying set optimization to weak efficiency ⋮ Well-posedness and stability of solutions for set optimization problems ⋮ Variational inequalities characterizing weak minimality in set optimization ⋮ Set-valued risk measures as backward stochastic difference inclusions and equations ⋮ Set Optimization—A Rather Short Introduction ⋮ Arcwise connectedness of the solution sets for set optimization problems

Uses Software

• BENSOLVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New order relations in set optimization
• The directional subdifferential of the difference of two convex functions
• A duality theory for set-valued functions. I: Fenchel conjugation theory
• Residuated lattices. An algebraic glimpse at substructural logics
• Generalized convexity and optimization. Theory and applications
• Epidifferentiability and hypodifferentiability of pseudoconvex maps in set-optimization problems
• Existence and Lagrangian duality for maximization of set-valued functions
• Approximation to a set-valued mapping. I: A proposal
• Directional derivatives for set-valued mappings and applications
• Contingent epiderivatives and set-valued optimization
• Variational methods in partially ordered spaces
• \(({\ast},s)\)-dualities
• Characterizations of convex and quasiconvex set-valued maps
• Continuity concepts for set-valued functions and a fundamental duality formula for set-valued optimization
• Minty variational inequalities, increase-along-rays property and optimization
• Power structures
• Convexity for set-valued maps
• Lagrangian duality in set-valued optimization
• First-order optimality conditions in set-valued optimization
• Strictly quasi-convex (concave) functions and duality in mathematical programming
• Set-relations and optimality conditions in set-valued maps
• Set Optimization Meets Variational Inequalities
• Notes about extended real- and set-valued functions
• Vector Optimization with Infimum and Supremum
• Solution concepts in vector optimization: a fresh look at an old story
• Multivalued convexity and optimization: A unified approach to inequality and equality constraints
• An Existence Theorem in Vector Optimization
• Variational Analysis
• On cone convexity of set-valued maps
• A multiplier rule in set-valued optimisation
• A characterization of quasiconvex vector-valued functions
• On the generalization of a direct method of the calculus of variations
• Seven Kinds of Convexity
• Set-valued analysis
• Optimality conditions for maximizations of set-valued functions

This page was built for publication: A Minty variational principle for set optimization