Pages that link to "Item:Q925238"

The following pages link to The spherical constraint in Boolean quadratic programs (Q925238):

Displaying 8 items.

• A variational approach of the rank function (Q356507) (← links)
• On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
• On the spherical quasi-convexity of quadratic functions (Q1629842) (← links)
• A low complexity semidefinite relaxation for large-scale MIMO detection (Q1702828) (← links)
• Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
• Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
• Improved row-by-row method for binary quadratic optimization problems (Q2327692) (← links)
• Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)