Partial Lagrangian relaxation for general quadratic programming
The authors give a complete characterization of constant quadratic functions over an affine variety. This result is used to convexify the objective function of a general quadratic programming problem (Pb) which contains linear equality constraints. Thanks to this convexification, the authors show that one can express as a semidefinite programm the dual of the partial Lagrangian relaxation of (Pb) where the linear constraints are not relaxed. The authors apply these results by comparing two semidefinite relaxations made from two sets of null quadratic functions over an affine variety.
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework
- New positive semidefinite relaxations for nonconvex quadratic programs
- Copositive realxation for genera quadratic programming
- scientific article; zbMATH DE number 1380758
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- A semidefinite programming approach to the quadratic knapsack problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- SDP relaxations in combinatorial optimization from a Lagrangian viewpoint.
- The omnipresence of Lagrange
- Quadratic convex reformulation for quadratic programming with linear on-off constraints
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- Dantzig-Wolfe reformulations for binary quadratic problems
- A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs
- Interplay of non-convex quadratically constrained problems with adjustable robust optimization
- Copositive programming
- Numerical study of semidefinite bounds for the k-cluster problem
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- Computational results of a semidefinite branch-and-bound algorithm for k-cluster
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- Quadratic convex reformulations for semicontinuous quadratic programming
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
- Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
- Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems
- Extending the QCR method to general mixed-integer programs
- The MIN-cut and vertex separator problem
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- An effective branch and bound algorithm for generalized risk parity portfolio optimization
This page was built for publication: Partial Lagrangian relaxation for general quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2644374)
