Existence and Lagrangian duality for maximization of set-valued functions
From MaRDI portal
Publication:1078091
DOI10.1007/BF00940198zbMath0595.90085MaRDI QIDQ1078091
Publication date: 1987
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
On Ha's version of set-valued Ekeland's variational principle ⋮ Necessary conditions for extremality and separation theorems with applications to multiobjective optimization ⋮ Lagrange multipliers and saddle points in multiobjective programming ⋮ Connectedness of efficient solution sets for set-valued maps in normed spaces ⋮ The Strictly Efficient Subgradient of Set-Valued Optimisation ⋮ Contingent derivatives of set-valued maps and applications to vector optimization ⋮ Nonconvex scalarization in set optimization with set-valued maps ⋮ A saddlepoint theorem for set-valued maps ⋮ Upper-semi-continuity and cone-concavity of multi-valued vector functions in a duality theory for vector optimization ⋮ Strict efficiency in vector optimization with nearly convexlike set-valued maps ⋮ Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps ⋮ Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions ⋮ Conjugate duality in set-valued vector optimization ⋮ On optimization problems with set-valued objective maps ⋮ Lagrangian duality for minimization of nonconvex multifunctions ⋮ Lagrangian duality for preinvex set-valued functions ⋮ A note on connectivity of efficient solution sets ⋮ Pointwise well-posedness and scalarization in set optimization ⋮ Axiomatic approach to duality in optimization ⋮ On constrained set-valued optimization problems with \(\rho\)-cone arcwise connectedness ⋮ Conjugate duality in set optimization via nonlinear scalarization ⋮ Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps ⋮ Pointwise well-posedness in set optimization with cone proper sets ⋮ Cone-compactness of a set and applications to set-equilibrium problems ⋮ Set-valued minimax programming problems under generalized cone convexity ⋮ Nonconvex vector optimization of set-valued mappings. ⋮ Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization. ⋮ Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems ⋮ Approximate Lagrangian duality and saddle point optimality in set optimization ⋮ On optimization problems with set-valued objective maps: existence and optimality ⋮ \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ Optimality conditions of the set-valued optimization problem with generalized cone convex set-valued maps characterized by contingent epiderivative ⋮ Superefficiency in vector optimization with nearly subconvexlike set-valued maps ⋮ Unnamed Item ⋮ Primal worst and dual best in robust vector optimization ⋮ Unnamed Item ⋮ Optimality and duality for multiobjective programming involving subdifferentiable set functions ⋮ A Minty variational principle for set optimization ⋮ Higher-order Mond-Weir duality for set-valued optimization ⋮ Lagrangian duality in set-valued optimization ⋮ Characterizing efficiency without linear structure: a unified approach ⋮ External and internal stability in set optimization ⋮ Second-order optimality conditions for set optimization using coradiant sets ⋮ On minimax fractional programming of generalized convex set functions ⋮ Optimality and duality in set-valued optimization utilizing limit sets ⋮ Variational inequalities characterizing weak minimality in set optimization ⋮ Theorems of the alternative for multifunctions. ⋮ On cone convexity of set-valued maps ⋮ Lagrange duality in set optimization ⋮ Nonlinear scalarization functions and polar cone in set optimization ⋮ A note on quasiconvex set-valued maps. ⋮ Set-valued derivatives of multifunctions and optimality conditions ⋮ e-weak minimal solutions of vector optimization problems with set-valued maps ⋮ Lagrange duality, stability and subdifferentials in vector optimization ⋮ Recession maps and applications ⋮ Optimality conditions for maximizations of set-valued functions ⋮ Sufficient optimality conditions and duality theorems for set-valued optimization problem under generalized cone convexity ⋮ Erratum for ``Higher-order weakly generalized adjacent epiderivatives and applications to duality of set-valued optimization ⋮ Topological properties of Henig globally efficient solutions of set-valued problems ⋮ Characterizations of solutions for vector equilibrium problems ⋮ Optimality conditions for maximizations of set-valued functions ⋮ Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior ⋮ Lagrangian duality for multiobjective programming problems in lexicographic order ⋮ The relationship between two kinds of generalized convex set-valued maps in real ordered linear spaces ⋮ Some variants of the Ekeland variational principle for a set-valued map ⋮ Higher-order optimality conditions and duality for approximate solutions in non-convex set-valued optimization ⋮ Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming ⋮ Existence of a solution and variational principles for vector equilibrium problems ⋮ Set Optimization—A Rather Short Introduction ⋮ Optimization with set relations: conjugate duality ⋮ Existence of efficient points in vector optimization and generalized Bishop-Phelps theorem ⋮ Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps ⋮ Benson proper efficiency in the vector optimization of set-valued maps ⋮ Duality for a minimax programming problem containing \(n\)-set functions ⋮ Existence theorems of set optimization with set-valued maps ⋮ Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions ⋮ Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization ⋮ Optimality conditions for set-valued minimax fractional programming problems ⋮ Continuity of solution maps to parametric set optimization problems via parametric equilibrium problems ⋮ An optimization result for set-valued mappings and a stability property in vector problems with constraints ⋮ Theorems of the alternative and optimization with set-valued maps ⋮ ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps ⋮ Lagrange duality in multiobjective fractional programming problems with \(n\)-set functions ⋮ Super efficiency in vector optimization with nearly convexlike set-valued maps. ⋮ Scalarization and well-posedness for set optimization using coradiant sets ⋮ On the existence of efficient points in locally convex spaces ⋮ Near-subconvexlikeness in vector optimization with set-valued functions ⋮ Extension of the Zorn lemma to general nontransitive binary relations ⋮ Second-order composed contingent epiderivatives and set-valued vector equilibrium problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An existence result for maximizations with respect to cones
- Duality theory for maximizations with respect to cones
- Duality theory in multiobjective programming
- A Duality Theorem in Multiobjective Nonlinear Programming
- Optimization and nonsmooth analysis
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- Generalized equations and their solutions, Part I: Basic theory
- Point-to-Set Maps in Mathematical Programming
