Saddle points and Lagrangian dual problems of vector mapping

zbMATH Open1134.90485MaRDI QIDQ5489984FDOQ5489984

Authors: Longguang Huang, Sanyang Liu 

Publication date: 4 October 2006

Recommendations

• Strict efficiency of set-valued optimization and scalar set-valued Lagrange mapping
• Saddle points and gap functions for vector equilibrium problems via conjugate duality in vector optimization
• Fenchel-Lagrange duality and saddle-points for constrained vector optimization
• Duality in nondifferentiable vector programming
• Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems

zbMATH Keywords

efficient solutionsaddle pointweak efficient solutiongeneralized Slater constraint qualificationsgeneralized cone sub convex-like

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)

Cited In (8)

• Title not available (Why is that?)
• Proper saddle points and properly efficient solutions to constrained vector optimization problems
• Splitting subspaces and saddle points
• Fenchel-Lagrange duality and saddle-points for constrained vector optimization
• Proper or weak efficiency via saddle point conditions in cone-constrained nonconvex vector optimization problems
• Algebraic representation of dual scalar products and stabilization of saddle point problems
• Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
• Title not available (Why is that?)

This page was built for publication: Saddle points and Lagrangian dual problems of vector mapping

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