SDP relaxations in combinatorial optimization from a Lagrangian viewpoint.
From MaRDI portal
Cited in
(29)- A note on computing the smallest conic singular value
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
- Convex reformulation for binary quadratic programming problems via average objective value maximization
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- Dantzig-Wolfe reformulations for binary quadratic problems
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- Partial Lagrangian relaxation for general quadratic programming
- A new approach to the stable set problem based on ellipsoids
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- On duality gap in binary quadratic programming
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- A guide to conic optimisation and its applications
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- The omnipresence of Lagrange
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- The MIN-cut and vertex separator problem
- Using the eigenvalue relaxation for binary least-squares estimation problems
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- The spherical constraint in Boolean quadratic programs
This page was built for publication: SDP relaxations in combinatorial optimization from a Lagrangian viewpoint.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768040)
