ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps

DOI10.1080/02331930802355374MaRDI QIDQ5505147zbMATH OpenOpenAlexFDO

Authors Jihong Jia, Zhongfei Li

Publication date 23 January 2009

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930802355374

zbMATH Keywords

\(\epsilon \)-conjugate duality\(\epsilon \)-conjugate maps\(\epsilon \)-weak efficiency\(\epsilon \)-weak subgradientsvector optimization with set-valued maps

Mathematics Subject Classification ID

Optimality conditions for problems in abstract spaces (49K27) Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Recommendations

• Conjugate duality in constrained set-valued vector optimization problems
• Conjugate duality in vector optimization
• Conjugate Maps, Subgradients and Conjugate Duality in Set-Valued Optimization
• ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
• Conjugate duality for set-valued vector optimization in finite dimensional spaces

Cites work

• \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
• -duality theorem of nondifferentiable nonconvex multiobjective programming
• \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
• \(\epsilon\)-solutions in vector minimization problems
• -optimality and duality for multiobjective fractional programming
• \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
• \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
• A generalization of ekellandz’s variational principle
• A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization
• A theorem of the alternative and its application to the optimization of set-valued maps
• A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
• Approximate saddle-point theorems in vector optimization
• Approximately Efficient Solutions in Vector Optimization
• Benson proper efficiency in the vector optimization of set-valued maps
• Between Pareto efficiency and Pareto ε-efficiency
• Conjugate duality in set-valued vector optimization
• Conjugate duality in vector optimization
• Conjugate maps and duality in multiobjective optimization
• Convergence of minimal and approximate minimal elements of sets in partially ordered vector spaces
• Duality for vector optimization of set-valued functions
• e-weak minimal solutions of vector optimization problems with set-valued maps
• Epsilon approximate solutions for multiobjective programming problems
• Epsilon efficiency
• Existence and Lagrangian duality for maximization of set-valued functions
• Existence of \(\varepsilon\)-minima for vector optimization problems
• Lagrangian duality for preinvex set-valued functions
• Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
• Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
• Nonconvex scalarization in set optimization with set-valued maps
• Nonconvex vector optimization of set-valued mappings.
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• On Approximate Solutions in Convex Vector Optimization
• On cone d. c. optimization and conjugate duality
• On several concepts for \(\varepsilon\)-efficiency
• On supremum of a set in a multidimensional space
• Optimality conditions for set-valued optimization problems
• Relationships between efficient set and -efficient set
• Set-relations and optimality conditions in set-valued maps
• Stability results for approximately efficient solutions
• Theorems of the alternative for multifunctions with applications to optimization: General results
• Theorems of the alternative for set-valued functions in infinite-dimensional spaces
• ε-approximate solutions in multiobjective optimization

Cited in

(9)

• Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
• Characterizing -properly efficient solutions
• ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
• Sensitivity analysis for a Lagrange dual problem to a vector optimization problem
• \(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps
• Conjugate duality theory for vector optimization problems
• Nonlinear separation theorems for co-radiant sets and optimality conditions for approximate and proper approximate solutions in vector optimization
• Conjugate duality in set optimization via subdifferential respect to set-order relations
• Duality related to approximate proper solutions of vector optimization problems

This page was built for publication: ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505147)