Approximate Lagrangian duality and saddle point optimality in set optimization

DOI10.1051/RO/2016068MaRDI QIDQ4603941zbMATH OpenOpenAlexFDO

Authors C. S. Lalitha, Mansi Dhingra

Publication date 23 February 2018

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2016068

zbMATH Keywords

approximate solutionsLagrangian dualityLagrangian multiplier rulesaddle point optimalityset optimization

Mathematics Subject Classification ID

Set-valued and variational analysis (49J53) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Lagrangian duality for the set optimization problem
• Lagrangian duality in set-valued optimization
• scientific article; zbMATH DE number 1187297
• Lagrange multipliers, duality, and sensitivity in set-valued convex programming via pointed processes
• Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps

Cites work

• Approximate saddle-point theorems in vector optimization
• Duality for vector optimization of set-valued functions
• e-weak minimal solutions of vector optimization problems with set-valued maps
• Existence and Lagrangian duality for maximization of set-valued functions
• Existence theorems of set optimization with set-valued maps
• Foundations of Optimization
• scientific article; zbMATH DE number 3662118 (Why is no real title available?)
• scientific article; zbMATH DE number 1377943 (Why is no real title available?)
• scientific article; zbMATH DE number 1380938 (Why is no real title available?)
• Lagrange duality in set optimization
• Lagrange duality, stability and subdifferentials in vector optimization
• Lagrangian duality for minimization of nonconvex multifunctions
• Lagrangian duality for vector optimization problem with set-valued mappings
• Lagrangian duality in set-valued optimization
• Lagrangian multipliers, saddle points, and duality in vector optimization of set-valued maps
• Near-subconvexlikeness in vector optimization with set-valued functions
• Nonconvex scalarization in set optimization with set-valued maps
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• On set-valued optimization.
• Optimality conditions for maximizations of set-valued functions
• Some duality theorems of set-valued optimization with natural criteria
• Vector Optimization with Infimum and Supremum

Cited in

(9)

• Lagrange multipliers, duality, and sensitivity in set-valued convex programming via pointed processes
• Duality theorems for convex and quasiconvex set functions
• Henig proper subdifferential of set-valued maps
• Lagrangian duality in set-valued optimization
• Approximate duality
• Lagrangian duality for the set optimization problem
• Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
• External and internal stability in set optimization
• Convergence of solutions in set optimization based on null set

Describes a project that uses

Uses Software

• BENSOLVE

This page was built for publication: Approximate Lagrangian duality and saddle point optimality in set optimization

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