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 optimization; convex optimization; saddle-point theorems; approximate primaldual pairs of solutions; nondominated approximate solutions
90C31: Sensitivity, stability, parametric optimization
Related Items
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, Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints, ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps, e-weak minimal solutions of vector optimization problems with set-valued maps, \(\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, \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions, \(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps, Optimality conditions for approximate solutions in multiobjective optimization problems, 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, Strict approximate duality in vector spaces, A saddle-point characterization of Pareto optima, On several concepts for \(\varepsilon\)-efficiency, Equivalent \(\varepsilon\)-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, Two Types of Approximate Saddle Points, ε-approximate solutions in multiobjective optimization
Cites Work
