Multiobjective duality for convex semidefinite programming problems
type: Item
instance of: scholarly article
title: Multiobjective duality for convex semidefinite programming problems
zbMATH Open document ID: 1137.90711
DOI: 10.4171/ZAA/1169
author: Gert Wanka
author: Radu I. Boţ
author: Sorin-Mihai Grad
published in: Zeitschrift für Analysis und ihre Anwendungen
publication date: 2004-05-27T00:00:00Z
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.
reviewed by: Paulo Mbunga
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 2068763
zbMATH Keywords: multiobjective duality
zbMATH Keywords: semidefinite programming
zbMATH Keywords: convex optimization
zbMATH Keywords: Pareto efficiency
MaRDI profile type: Publication
cites work: Q4517113
cites work: Q4085497
cites work: Semidefinite programming
cites work: Q4517100
cites work: Q4324980
cites work: Extension of Fenchel's duality theorem for convex functions
cites work: Convex Analysis
cites work: Q4517099
cites work: Semidefinite Programming
cites work: Q4551946
cites work: Q2712296
cites work: Multiobjective duality for convex ratios.
description: scientific article; zbMATH DE number 2068763