Multiobjective duality for convex semidefinite programming problems

DOI10.4171/ZAA/1169MaRDI QIDQ1431149zbMATH OpenFDO

Authors Gert Wanka, Radu I. Boţ, Sorin-Mihai Grad

Publication date 27 May 2004

Published in Zeitschrift für Analysis und ihre Anwendungen (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4171/ZAA/1169

zbMATH Keywords

convex optimizationmultiobjective dualityPareto efficiencysemidefinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Review text

In this paper some duality assertions regarding multiobjective convex semidefinite programming are treated. First, the authors study the duality properties and the optimality conditions of the scalarized problem associated to the initial one. Using these results the weak, strong and converse duality assertions regarding the primal problem and its dual is presented. The dual problem is obtained using the so-called conjugacy approach.

Recommendations

• Duality for multiobjective semidefinite optimization problems
• The optimality conditions and duality theory for multiobjective semidefinite programming
• Lagrange duality and saddle points theorem for multiobjective semidefinite programming
• Multiobjective duality for convex-linear problems. II
• scientific article; zbMATH DE number 1594507

Cites work

• Convex Analysis
• Extension of Fenchel's duality theorem for convex functions
• scientific article; zbMATH DE number 1594507 (Why is no real title available?)
• scientific article; zbMATH DE number 3504682 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 1534290 (Why is no real title available?)
• scientific article; zbMATH DE number 1534291 (Why is no real title available?)
• scientific article; zbMATH DE number 1534304 (Why is no real title available?)
• scientific article; zbMATH DE number 1792004 (Why is no real title available?)
• Multiobjective duality for convex ratios.
• Semidefinite programming
• Semidefinite Programming

Cited in

(12)

• Existence of solutions of a vector optimization problem with a generic lower semicontinuous objective function
• Generic existence of solutions in vector optimization on metric spaces
• Optimality and duality in multiobjective programming involving higher order semilocally strong convexity
• Semidefinite programming via image space analysis
• A general approach for studying duality in multiobjective optimization
• Duality for multiobjective semidefinite optimization problems
• scientific article; zbMATH DE number 5283949 (Why is no real title available?)
• The optimality conditions and duality theory for multiobjective semidefinite programming
• Lagrange duality and saddle points theorem for multiobjective semidefinite programming
• The conjugate duality of nonlinear semidefinite programming
• Computing the recession cone of a convex upper image via convex projection
• Image space analysis for vector variational inequalities with matrix inequality constraints and applications

This page was built for publication: Multiobjective duality for convex semidefinite programming problems

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