On some efficiency conditions for vector optimization problems with uncertain cone constraints: a robust approach via set-valued inclusions

DOI10.1080/02331934.2021.1934681zbMath1493.90174arXiv2101.12542OpenAlexW3170053277MaRDI QIDQ5077158

Amos Uderzo

Publication date: 18 May 2022

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

vector optimization problemdata uncertaintygeneralized derivativerobust approachweak efficiency condition

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Robustness in mathematical programming (90C17)

Related Items

Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The exact penalty principle
• Nonsmooth analysis
• Prederivatives of convex set-valued maps and applications to set optimization problems
• Theory of multiobjective optimization
• A survey of vector optimization in infinite-dimensional spaces. II
• On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
• Robust optimization-methodology and applications
• Necessary conditions in nonsmooth minimization via lower and upper subgradients
• On the quantitative solution stability of parameterized set-valued inclusions
• Nonlinear local error bounds via a change of metric
• Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints
• On robust multiobjective optimization
• Robust Convex Optimization
• Generalized Differentiation with Positively Homogeneous Maps: Applications in Set-Valued Analysis and Metric Regularity
• Nonsmooth Analysis: Differential Calculus of Nondifferentiable Mappings
• An Implicit-Function Theorem for a Class of Nonsmooth Functions
• On some generalized equations with metrically C-increasing mappings: solvability and error bounds with applications to optimization
• Some topics in vector optimization via image space analysis
• On Differential Properties of Multifunctions Defined Implicitly by Set-Valued Inclusions
• Set-valued Optimization
• Convex Analysis
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• Set-valued analysis
• Optimality and duality for robust multiobjective optimization problems