Lagrangian duality for minimization of nonconvex multifunctions
From MaRDI portal
Publication:1379972
DOI10.1023/A:1022658019642zbMath0901.90161OpenAlexW202964156MaRDI QIDQ1379972
Publication date: 26 November 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022658019642
Multi-objective and goal programming (90C29) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Optimality conditions for vector optimisation with set-valued maps, Strict efficiency in vector optimization with nearly convexlike set-valued maps, Conjugate duality in set-valued vector optimization, Necessary conditions for efficient solution of vector optimization problems, Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces, Approximate weak minimal solutions of set-valued optimization problems, Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps, \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions, Approximate Lagrangian duality and saddle point optimality in set optimization, Superefficiency in vector optimization with nearly subconvexlike set-valued maps, Higher-order Mond-Weir duality for set-valued optimization, Image space approach and subdifferentials of integral functionals, A note on quasiconvex set-valued maps., The Lagrange multiplier rule for super efficiency in vector optimization, Second-order conditions for nonsmooth multiobjective optimization problems with inclusion constraints, Topological properties of Henig globally efficient solutions of set-valued problems, Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior, Lagrangian duality for multiobjective programming problems in lexicographic order, Set Optimization—A Rather Short Introduction, The connectedness of the solutions set for set-valued vector equilibrium problems under improvement sets, Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems, Henig efficiency in vector optimization with nearly cone-subconvexlike set-valued functions, Connectedness properties of the efficient sets and the nondominated sets to vector optimization problems, Super efficiency in vector optimization with nearly convexlike set-valued maps., Near-subconvexlikeness in vector optimization with set-valued functions
Cites Work
- Unnamed Item
- Unnamed Item
- On general minimax theorems
- Inequality systems and optimization
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Existence and Lagrangian duality for maximization of set-valued functions
- An improved definition of proper efficiency for vector maximization with respect to cones
- Perfect duality for convexlike programs
- Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
- A solvability theorem for a class of quasiconvex mappings with applications to optimization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Invex multifunctions and duality
- Convexlike alternative theorems and mathematical programming
- The geometry of Pareto efficiency over cones
- Proper Efficient Points for Maximizations with Respect to Cones
