Pages that link to "Item:Q2467162"

The following pages link to Invariance and efficiency of convex representations (Q2467162):

Displaying 13 items.

• Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
• Semidefinite descriptions of low-dimensional separable matrix cones (Q932159) (← links)
• Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
• Strong duality and minimal representations for cone optimization (Q1928754) (← links)
• On strong duality in linear copositive programming (Q2149604) (← links)
• Amenable cones: error bounds without constraint qualifications (Q2227528) (← links)
• Convex sets with semidefinite representation (Q2391000) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
• Facially Dual Complete (Nice) Cones and Lexicographic Tangents (Q5234283) (← links)
• Exact Duality in Semidefinite Programming Based on Elementary Reformulations (Q5501234) (← links)
• Amenable Cones Are Particularly Nice (Q5869817) (← links)
• Linear optimization over homogeneous matrix cones (Q6047504) (← links)