Pages that link to "Item:Q1905964"
From MaRDI portal
The following pages link to A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964):
Displaying 15 items.
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← 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)
- A fresh variational-analysis look at the positive semidefinite matrices world (Q438781) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (Q623464) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
- A Derivation of Lovász' Theta via Augmented Lagrange Duality (Q4809664) (← links)
- Invariants of SDP exactness in quadratic programming (Q6184179) (← links)
