Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
From MaRDI portal
Publication:764948
DOI10.1016/j.jmaa.2011.12.050zbMath1261.90049OpenAlexW1981805154MaRDI QIDQ764948
César Gutiérrez, Lidia Huerga, Vicente Novo Sanjurjo
Publication date: 16 March 2012
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2011.12.050
Lagrangian functionlinear scalarizationSlater constraint qualificationapproximate proper saddle point theoremnearly subconvexlike mappingproper \(\varepsilon \)-efficiency
Related Items (17)
Characterizations of improvement sets via quasi interior and applications in vector optimization ⋮ Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone ⋮ Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems ⋮ Chain rules for a proper \(\varepsilon\)-subdifferential of vector mappings ⋮ Sublinear scalarizations for proper and approximate proper efficient points in nonconvex vector optimization ⋮ Duality related to approximate proper solutions of vector optimization problems ⋮ Unnamed Item ⋮ A kind of unified proper efficiency in vector optimization ⋮ Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications ⋮ Approximate solutions of vector optimization problems via improvement sets in real linear spaces ⋮ Ekeland variational principles involving set perturbations in vector equilibrium problems ⋮ Approximate proper solutions in vector equilibrium problems. Limit behavior and linear scalarization results ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Approximate proper efficiency in vector optimization ⋮ Limit Behavior of Approximate Proper Solutions in Vector Optimization ⋮ Approximate proper efficiency for multiobjective optimization problems ⋮ Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions for approximate solutions of vector optimization problems
- Separable conditions and scalarization of Benson proper efficiency
- Nearly subconvexlike set-valued maps and vector optimization problems
- Proper efficiency in vector optimization on real linear spaces.
- Duality and saddle-points for convex-like vector optimization problems on real linear spaces
- On approximate efficiency in multiobjective programming
- On duality theory in multiobjective programming
- An improved definition of proper efficiency for vector maximization with respect to cones
- Duality theory for maximizations with respect to cones
- Duality theory in multiobjective programming
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- Benson proper efficiency in the vector optimization of set-valued maps
- Lagrange multipliers and saddle points in multiobjective programming
- Near-subconvexlikeness in vector optimization with set-valued functions
- Approximate saddle-point theorems in vector optimization
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
- Approximate duality
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Two Types of Approximate Saddle Points
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- Dual Characterization and Scalarization for Benson Proper Efficiency
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- e-weak minimal solutions of vector optimization problems with set-valued maps
This page was built for publication: Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
