Strong Duality in Robust Convex Programming: Complete Characterizations (Q3083336): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59241564, #quickstatements; #temporary_batch_1703768564763
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Vaithilingam Jeyakumar / rank
Normal rank
 
Property / author
 
Property / author: Vaithilingam Jeyakumar / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/100791841 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2010724422 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:06, 19 March 2024

scientific article
Language Label Description Also known as
English
Strong Duality in Robust Convex Programming: Complete Characterizations
scientific article

    Statements

    Strong Duality in Robust Convex Programming: Complete Characterizations (English)
    0 references
    0 references
    0 references
    21 March 2011
    0 references
    convex programming under uncertainty
    0 references
    robust optimization
    0 references
    strong duality
    0 references
    Lagrangian duality
    0 references
    cone constraint qualification
    0 references
    generalized Slater condition
    0 references
    characteristic cone
    0 references
    theorem of the alternative
    0 references
    parameterized inequality system
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references