Partial Lagrangian relaxation for general quadratic programming
- 282 Downloads
We 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, we show that one can express as a semidefinite program the dual of the partial Lagrangian relaxation of (Pb) where the linear constraints are not relaxed. We apply these results by comparing two semidefinite relaxations made from two sets of null quadratic functions over an affine variety.
KeywordsQuadratic programming Lagrangian relaxations Semidefinite programming
MSC classification90C20 90C22
Unable to display preview. Download preview PDF.
- Billionnet A (2005). Different formulations for solving the heaviest k-subgraph problem. Inf Syst Oper Res, 43(3):171–186Google Scholar
- Lemaréchal C (2003), The omnipresence of Lagrange. 4’OR 1:7–25Google Scholar
- Lemaréchal C, Oustry F (2001) Semidefinite relaxations in combinatorial optimization from a lagrangian point of view. In: Hadjisavvas N, Pardalos PM, (eds), Advances in convex analysis and global optim. Kluwer, Dordrecht, pp. 119–134Google Scholar
- Luenberger DG (1989) Linear and nonlinear programming. Addison Wesley, ReadingGoogle Scholar
- Peressini AL, Sullivan FE, Uhl Jr. JJ (1988) The mathematics of nonlinear programming. Undergraduate Texts in Mathematics, Springer, Berlin Heidelberg New yorkGoogle Scholar