Approximate saddle-point theorems in vector optimization

Review text

The paper contains definitions of different types of nondominated approximate solutions to vector optimization problems and gives some of their elementary properties. Then, saddle-point theorems corresponding to these solutions are presented with an application relative to approximate primal-dual pairs of solutions.

Recommendations

Cites work

Cited in

(34)

Strict approximate duality in vector spaces
A saddle-point characterization of Pareto optima
On several concepts for \(\varepsilon\)-efficiency
Saddle-point optimality: a look beyond convexity
Equivalent -efficiency notions in vector optimization
Ekeland variational principles involving set perturbations in vector equilibrium problems
Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
\(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization
Optimality conditions for metrically consistent approximate solutions in vector optimization
Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
Saddle points and Pareto points in multiple objective programming
Approximate saddle point assertions for a general class of approximation problems
ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
Two Types of Approximate Saddle Points
\(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems
-strict subdifferentials of set-valued maps and optimality conditions
ε-approximate solutions in multiobjective optimization
A generalization of ekellandz’s variational principle
Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
Approximate Lagrangian duality and saddle point optimality in set optimization
Scalarization approach for approximation of weakly efficient solutions of set-valued optimization problems
\(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps
Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
scientific article; zbMATH DE number 2196495 (Why is no real title available?)
Connections between vector optimization problems, their solutions and saddle points
ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
e-weak minimal solutions of vector optimization problems with set-valued maps
Optimality conditions for approximate solutions in multiobjective optimization problems
Approximate solutions for multi-objective optimization problems via scalarizing and nonscalarizing methods
Nonlinear separation theorems for co-radiant sets and optimality conditions for approximate and proper approximate solutions in vector optimization
Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems
On approximate efficiency in multiobjective programming
Duality related to approximate proper solutions of vector optimization problems