The following pages link to (Q2768040):
Displaying 25 items.
- 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 majorization-minimization approach to the sparse generalized eigenvalue problem (Q413888) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569) (← links)
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems (Q620513) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Using the eigenvalue relaxation for binary least-squares estimation problems (Q839052) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- The spherical constraint in Boolean quadratic programs (Q925238) (← links)
- A note on computing the smallest conic singular value (Q1636761) (← links)
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring (Q1774164) (← links)
- Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
- Partial Lagrangian relaxation for general quadratic programming (Q2644374) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
