Pages that link to "Item:Q5737726"

The following pages link to Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726):

Displaying 7 items.

• Convexification of generalized network flow problem (Q1717233) (← links)
• Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
• Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
• (Q5148989) (← links)
• A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)