A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions (Q2465563): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Semidefinite programming duality and linear time-invariant systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially finite convex programming. I: Quasi relative interiors and duality theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequalities in System and Control Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple closure condition for the normal cone intersection formula / 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: Q4250283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fenchel duality and the strong conical hull intersection property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong conical hull intersection property for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Slater's constraint qualification for infinite convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigating duality on stability conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact duality theory for semidefinite programming and its complexity implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank

Latest revision as of 14:43, 27 June 2024

scientific article
Language Label Description Also known as
English
A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
scientific article

    Statements

    A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions (English)
    0 references
    4 January 2008
    0 references
    semidefinite optimization
    0 references
    constraint qualifications
    0 references
    strong duality
    0 references
    convex programming
    0 references

    Identifiers