Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (Q837124): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59241585, #quickstatements; #temporary_batch_1711574657256
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4779970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of optimal solutions and duality results under weak conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality gap of the conic convex constrained optimization problems in normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new geometric condition for Fenchel's duality in infinite dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for stable conjugate duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint qualifications characterizing Lagrangian duality in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete characterizations of stable Farkas' lemma and cone-convex programming duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero duality gaps in infinite-dimensional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Closedness of the Linear Image of a Closed Convex Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal duality in conic convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some convex programs without a duality gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: On duality theory of convex semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149262 / rank
 
Normal rank

Latest revision as of 22:35, 1 July 2024

scientific article
Language Label Description Also known as
English
Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
scientific article

    Statements

    Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs (English)
    0 references
    10 September 2009
    0 references
    second-order cone programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers