Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs (Q5243181): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q113779121, #quickstatements; #temporary_batch_1711574657256
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1709.02423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of diagonally dominant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3585439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set intersection theorems and existence of optimal solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Polyhedrality of Spectrahedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Optimization and Convex Algebraic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5852055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4581771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularizing the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Computation of the Region of Attraction of Polynomial Control Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotes and Projections of Convex Sets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Duality in Semidefinite Programming Based on Elementary Reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A STRUCTURAL GEOMETRICAL ANALYSIS OF WEAKLY INFEASIBLE SDPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4642622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic degree of semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517098 / 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 in Conic Linear Programming: Facial Reduction and Extended Duals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bad Semidefinite Programs: They All Look the Same / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone / 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: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality and minimal representations for cone optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: WHAT IS...a Spectrahedron? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facial reduction algorithms for conic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2988743386 / rank
 
Normal rank

Latest revision as of 09:31, 30 July 2024

scientific article; zbMATH DE number 7130732
Language Label Description Also known as
English
Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs
scientific article; zbMATH DE number 7130732

    Statements

    Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs (English)
    0 references
    0 references
    0 references
    15 November 2019
    0 references
    semidefinite programming
    0 references
    duality
    0 references
    duality gap
    0 references
    pathological semidefinite programs
    0 references
    closedness of the linear image of the semidefinite cone
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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