Lagrange duality and saddle points theorem for multiobjective semidefinite programming

zbMATH Open1096.90025MaRDI QIDQ5483764FDOQ5483764

Authors: Chao Li, Xiaomin Wang 

Publication date: 23 August 2006

Recommendations

• The optimality conditions and duality theory for multiobjective semidefinite programming
• Multiobjective duality for convex semidefinite programming problems
• The weak proper efficiency of multiobjective semidefinite programming with set-valued maps
• scientific article; zbMATH DE number 6796429
• scientific article; zbMATH DE number 500378

zbMATH Keywords

Lagrange dualitysaddle pointweak efficient solutionconvexlike functionmultiobjective semidefinite programming

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Semidefinite programming (90C22)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The study of the existence of saddle point for nonconvex semidefinite programming problems
• Approximate Saddle Point and Duality for Multiobjective n-Set Optimization
• Multiobjective duality for convex semidefinite programming problems
• Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
• Duality for multiobjective semidefinite optimization problems

This page was built for publication: Lagrange duality and saddle points theorem for multiobjective semidefinite programming

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