Multiobjective duality for convex semidefinite programming problems (Q1431149): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Radu Ioan Boţ / rank
 
Normal rank
Property / author
 
Property / author: Sorin-Mihai Grad / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of Fenchel's duality theorem for convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective duality for convex ratios. / rank
 
Normal rank

Latest revision as of 17:35, 6 June 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
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    multiobjective duality
    0 references
    semidefinite programming
    0 references
    convex optimization
    0 references
    Pareto efficiency
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references