Approximate saddle-point theorems in vector optimization
From MaRDI portal
Publication:1821701
DOI10.1007/BF00941179zbMath0616.90076MaRDI QIDQ1821701
Publication date: 1987
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
vector optimizationconvex optimizationsaddle-point theoremsapproximate primaldual pairs of solutionsnondominated approximate solutions
Related Items
A saddle-point characterization of Pareto optima ⋮ On several concepts for \(\varepsilon\)-efficiency ⋮ On approximate efficiency in multiobjective programming ⋮ Strict approximate duality in vector spaces ⋮ Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization ⋮ \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints ⋮ Optimality conditions for approximate solutions in multiobjective optimization problems ⋮ Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems ⋮ Equivalent \(\varepsilon\)-efficiency notions in vector optimization ⋮ \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions ⋮ A generalization of ekellandz’s variational principle ⋮ Two Types of Approximate Saddle Points ⋮ Duality related to approximate proper solutions of vector optimization problems ⋮ Approximate Lagrangian duality and saddle point optimality in set 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 ⋮ \(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps ⋮ e-weak minimal solutions of vector optimization problems with set-valued maps ⋮ Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems ⋮ Ekeland variational principles involving set perturbations in vector equilibrium problems ⋮ Approximate Saddle Point and Duality for Multiobjective n-Set Optimization ⋮ Scalarization approach for approximation of weakly efficient solutions of set-valued optimization problems ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints ⋮ Saddle points and Pareto points in multiple objective programming ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ ε-approximate solutions in multiobjective optimization
Cites Work
