Multiobjective duality for convex semidefinite programming problems (Q1431149): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 04:18, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multiobjective duality for convex semidefinite programming problems |
scientific article |
Statements
Multiobjective duality for convex semidefinite programming problems (English)
0 references
27 May 2004
0 references
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.
0 references
multiobjective duality
0 references
semidefinite programming
0 references
convex optimization
0 references
Pareto efficiency
0 references