Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872): Difference between revisions

From MaRDI portal
← Older editNewer edit →
‎Created claim: Wikidata QID (P12): Q128119462, #quickstatements; #temporary_batch_1722357939539
Normalize DOI.
Property / DOI
 
Property / DOI: 10.1007/s10479-019-03216-z / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S10479-019-03216-Z / rank
 
Normal rank

Revision as of 10:15, 9 December 2024

scientific article
Language Label Description Also known as
English
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
scientific article

    Statements

    title
    Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (English)
    0 references
    author
    Liguo Jiao
    0 references
    Jae Hyoung Lee
    0 references
    publication date
    5 May 2021
    0 references
    zbMATH Keywords
    multiobjective optimization
    0 references
    robust optimization
    0 references
    semidefinite programming relaxations
    0 references
    SOS-convex polynomials
    0 references
    describes a project that uses
    SDPT3
    0 references
    CVX
    0 references
    cites work
    Q3182207
    0 references
    Q4821526
    0 references
    Q3760254
    0 references
    Q4557933
    0 references
    Q2841072
    0 references
    Convex Analysis
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C29
    0 references
    90C17
    0 references
    90C22
    0 references
    52A41
    0 references
    zbMATH DE Number
    7344088
    0 references
    OpenAlex ID
    W2936699287
    0 references
    Wikidata QID
    Q128119462
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q828872&oldid=38248134"
    Powered by MediaWiki