Pages that link to "Item:Q697582"

The following pages link to Semidefinite programming for discrete optimization and matrix completion problems (Q697582):

Displaying 15 items.

• Structure methods for solving the nearest correlation matrix problem (Q270046) (← links)
• Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← links)
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
• Using the eigenvalue relaxation for binary least-squares estimation problems (Q839052) (← links)
• Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming (Q999796) (← links)
• A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
• Dimensionality reduction of SDPs through sketching (Q1713333) (← links)
• An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
• Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality (Q2273897) (← links)
• A convex optimisation framework for the unequal-areas facility layout problem (Q2275810) (← links)
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
• An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
• A note on the Lasserre hierarchy for different formulations of the maximum independent set problem (Q2661585) (← links)
• Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
• A guide to conic optimisation and its applications (Q4634309) (← links)