SDP reformulation for robust optimization problems based on nonconvex QP duality (Q354630): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Masao Fukushima / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6189556 / rank
 
Normal rank
Property / zbMATH Keywords
 
robust optimization
Property / zbMATH Keywords: robust optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
second-order cone programming
Property / zbMATH Keywords: second-order cone programming / rank
 
Normal rank
Property / zbMATH Keywords
 
semidefinite programming
Property / zbMATH Keywords: semidefinite programming / rank
 
Normal rank
Property / zbMATH Keywords
 
nonconvex quadratic programming
Property / zbMATH Keywords: nonconvex quadratic programming / rank
 
Normal rank

Revision as of 09:10, 28 June 2023

scientific article
Language Label Description Also known as
English
SDP reformulation for robust optimization problems based on nonconvex QP duality
scientific article

    Statements

    SDP reformulation for robust optimization problems based on nonconvex QP duality (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 July 2013
    0 references
    robust optimization
    0 references
    second-order cone programming
    0 references
    semidefinite programming
    0 references
    nonconvex quadratic programming
    0 references

    Identifiers