The Lipschitzianity of convex vector and set-valued functions
From MaRDI portal
Publication:286214
DOI10.1007/s11750-015-0401-0zbMath1348.46004OpenAlexW1926066995MaRDI QIDQ286214
Christiane Tammer, Vu Anh Tuan, Constantin Zalinescu
Publication date: 20 May 2016
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-015-0401-0
Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53) Convex functions and convex programs in convex geometry (52A41) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Ordered topological linear spaces, vector lattices (46A40)
Related Items
A Hausdorff-type distance, a directional derivative of a set-valued map and applications in set optimization ⋮ Lagrange multipliers in convex set optimization with the set and vector criteria ⋮ Higher-Order Karush--Kuhn--Tucker Conditions in Nonsmooth Optimization ⋮ Lipschitz properties of convex functions ⋮ Bernstein-Doetsch-type criteria for the continuity and Lipschitz continuity of convex set-valued mappings ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonconvex separation theorems and some applications in vector optimization
- Lagrange necessary conditions for Pareto minimizers in Asplund spaces and applications
- Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
- On the continuity of vector convex multivalued functions
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Lagrangian conditions for vector optimization in Banach spaces
- Existence of minimizers and necessary conditions in set-valued optimization with equilibrium constraints.
- Subdifferentials of compactly Lipschitzian vector-valued functions
- Nonsmooth analysis and optimization on partially ordered vector spaces
- Convex functions, monotone operators and differentiability
- Convex vector functions and their subdifferential
- On the \(C\)-Lipschitz continuities and \(C\)-approximations of multivalued mappings
- Variational methods in partially ordered spaces
- Scalarization in geometric and functional vector optimization revisited
- Ordered linear spaces
- Fuzzy necessary optimality conditions for vector optimization problems
- Continuity and Differentiability Properties of Convex Operators
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Degrees of Efficiency and Degrees of Minimality
- Another Proof that Convex Functions are Locally Lipschitz
- Optimality Conditions for Several Types of Efficient Solutions of Set-Valued Optimization Problems
- Set-valued Optimization
- Convex Analysis
- Sous-Différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné.
