Lagrangian duality for minimization of nonconvex multifunctions

DOI10.1023/A:1022658019642zbMATH Open0901.90161OpenAlexW202964156MaRDI QIDQ1379972FDOQ1379972

J. Ning

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

Recommendations

• Lagrangian duality for vector optimization problem with set-valued mappings
• scientific article; zbMATH DE number 3852802
• Nonconvex theorems of the alternative and minimization
• Vector optimization and generalized Lagrangian duality
• scientific article

zbMATH Keywords

vector optimizationalternative type theoremsnearly convexlike functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Convexity of real functions of several variables, generalizations (26B25)

Cites Work

• Existence and Lagrangian duality for maximization of set-valued functions
• Title not available (Why is that?)
• Invex multifunctions and duality
• On general minimax theorems
• An improved definition of proper efficiency for vector maximization with respect to cones
• Proper Efficient Points for Maximizations with Respect to Cones
• Convexlike and concavelike conditions in alternative, minimax, and minimization theorems
• Convexlike alternative theorems and mathematical programming
• Inequality systems and optimization
• A generalization of a minimax theorem of Fan via a theorem of the alternative
• Perfect duality for convexlike programs
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• A solvability theorem for a class of quasiconvex mappings with applications to optimization
• The geometry of Pareto efficiency over cones
• Title not available (Why is that?)

Cited In (33)

• Approximate weak minimal solutions of set-valued optimization problems
• Lagrangian duality for multiobjective programming problems in lexicographic order
• Second-order conditions for nonsmooth multiobjective optimization problems with inclusion constraints
• Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
• \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions
• Higher-order Mond-Weir duality for set-valued optimization
• Near-subconvexlikeness in vector optimization with set-valued functions
• Optimality conditions for vector optimisation with set-valued maps
• Super efficiency in vector optimization with nearly convexlike set-valued maps.
• Title not available (Why is that?)
• Superefficiency in vector optimization with nearly subconvexlike set-valued maps
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
• Lagrange duality and partitioning techniques in nonconvex global optimization
• Topological properties of Henig globally efficient solutions of set-valued problems
• Image space approach and subdifferentials of integral functionals
• Approximate Lagrangian duality and saddle point optimality in set optimization
• Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps
• 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
• A note on quasiconvex set-valued maps.
• Necessary conditions for efficient solution of vector optimization problems
• Necessary and sufficient conditions for weak efficiency in non-smooth vectorial optimization problems
• Approximate weak efficiency of the set-valued optimization problem with variable ordering structures
• On Lagrange Duality for Several Classes of Nonconvex Optimization Problems
• Conjugate duality in set-valued vector optimization
• The connectedness of the solutions set for set-valued vector equilibrium problems under improvement sets
• Nonconvex vector minimization with set inclusion constraint
• Strict efficiency in vector optimization with nearly convexlike set-valued maps
• Title not available (Why is that?)
• Convergence of Lagrange Multipliers and Dual Variables for Convex Optimization Problems
• Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
• The Lagrange multiplier rule for super efficiency in vector optimization
• Set Optimization—A Rather Short Introduction

This page was built for publication: Lagrangian duality for minimization of nonconvex multifunctions

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