Pages that link to "Item:Q1928754"

The following pages link to Strong duality and minimal representations for cone optimization (Q1928754):

Displaying 22 items.

• A search for quantum coin-flipping protocols using optimization techniques (Q263220) (← links)
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
• Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
• On strong duality in linear copositive programming (Q2149604) (← links)
• Kurdyka-Łojasiewicz exponent via inf-projection (Q2162122) (← links)
• Immobile indices and CQ-free optimality criteria for linear copositive programming problems (Q2174923) (← links)
• Amenable cones: error bounds without constraint qualifications (Q2227528) (← links)
• Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
• A complementarity partition theorem for multifold conic systems (Q2434990) (← links)
• An exact explicit dual for the linear copositive programming problem (Q2679002) (← links)
• Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
• Facial Reduction and Partial Polyhedrality (Q4586172) (← links)
• Solving SDP completely with an interior point oracle (Q4999336) (← links)
• On equivalent representations and properties of faces of the cone of copositive matrices (Q5044098) (← links)
• Refining the partition for multifold conic optimization problems (Q5151515) (← links)
• Optimality conditions for linear copositive programming problems with isolated immobile indices (Q5207739) (← links)
• Facially Dual Complete (Nice) Cones and Lexicographic Tangents (Q5234283) (← links)
• Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP (Q5242927) (← links)
• Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs (Q5243181) (← links)
• Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
• Optimization under uncertainty and risk: quadratic and copositive approaches (Q6113346) (← links)
• Lagrangian duality in convex conic programming with simple proofs (Q6200791) (← links)