Skip to main content
SpringerLink
Log in

On convex relaxations for quadratically constrained quadratic programming

  • Full Length Paper
  • Series B
  • Published:
Mathematical Programming Submit manuscript

Abstract

We consider convex relaxations for the problem of minimizing a (possibly nonconvex) quadratic objective subject to linear and (possibly nonconvex) quadratic constraints. Let \(\mathcal{F }\) denote the feasible region for the linear constraints. We first show that replacing the quadratic objective and constraint functions with their convex lower envelopes on \(\mathcal{F }\) is dominated by an alternative methodology based on convexifying the range of the quadratic form \(\genfrac(){0.0pt}{}{1}{x}\genfrac(){0.0pt}{}{1}{x}^T\) for \(x\in \mathcal{F }\). We next show that the use of “\(\alpha \)BB” underestimators as computable estimates of convex lower envelopes is dominated by a relaxation of the convex hull of the quadratic form that imposes semidefiniteness and linear constraints on diagonal terms. Finally, we show that the use of a large class of D.C. (“difference of convex”) underestimators is dominated by a relaxation that combines semidefiniteness with RLT constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

Notes

  1. The convex lower envelope is defined at the beginning of the next section.

  2. In the literature, the convex lower envelope of \(f(\cdot )\) is sometimes called simply the convex envelope of \(f(\cdot )\). We prefer to include the word “lower” as a reminder that the convex (lower) envelope is an underestimator of \(f(\cdot )\).

  3. The problem 50-050-1 is structurally similar to the other problems considered. One possibility to attempt to reduce the gap on this problem, which we have not attempted, would be to impose additional valid constraints from the BQP as considered in [21].

References

  1. Androulakis, I.P., Maranas, C.D., Floudas, C.A.: \(\alpha \)BB: A global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7, 337–363 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43, 471–484 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Anstreicher, K.M., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. Math. Prog. B 124, 33–43 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bomze, I.M.: Branch-and-bound approaches to standard quadratic optimization problems. J. Glob. Optim. 22, 27–37 (2002)

    Article  MathSciNet  Google Scholar 

  5. Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Prog. 120, 479–495 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Burer, S., Letchford, A.N.: On nonconvex quadratic programming with box constraints. SIAM J. Optim. 20, 1073–1089 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Burer, S., Saxena, A. : The MILP road to MIQCP. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, IMA Volumes in Mathematics and its Applications, vol. 154, pp. 373–406. Springer (2011)

  8. Burer, S., Vandenbussche, D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Prog. 113, 259–282 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 2nd edn. Springer, Berlin (1993)

    Google Scholar 

  10. Linderoth, J.: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Prog. 103, 251–282 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Markót, M.C., Csendes, T.: A new verified optimization technique for the “packing circles in a unit square” problems. SIAM J. Optim. 16, 193–219 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Padberg, M.: The Boolean quadric polytope: some characteristics, facets and relatives. Math. Prog. B 45, 139–172 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  13. Poljak, S., Wolkowicz, H.: Convex relaxations of (0,1) quadratic programming. Math. Oper. Res. 20, 550–561 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)

    MATH  Google Scholar 

  15. Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Glob Optim. 8, 201–205 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  16. Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Dordrecht (1998)

    Google Scholar 

  17. Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11–12, 625–653 (1999)

    Article  MathSciNet  Google Scholar 

  18. Szabó, P.G., Markót, M.C., Csendes, T.: Global optimization in geometry—circle packing into the square. In: Audet, C., Hansen, P., Savard, G. (eds.) Essays and Surveys in Global Optimization, pp. 233–266. Kluwer, Dordrecht (2005)

  19. Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49–95 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  20. Vandenbussche, D., Nemhauser, G.: A branch-and-cut algorithm for nonconvex quadratic programming with box constraints. Math. Prog. 102, 559–575 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  21. Yajima, Y., Fujie, T.: A polyhedral approach for nonconvex quadratic programming problems with box constraints. J. Glob. Optim. 13, 151–170 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  22. Zheng, X.J., Sun, X.L., Li, D.: Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations. J. Glob. Optim. 50, 695–712 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

I am grateful to two anonymous referees for corrections and suggestions that have improved the paper.

Author information

Authors and Affiliations

  1. Department of Management Sciences, University of Iowa, Iowa City, IA, 52242, USA

    Kurt M. Anstreicher

Authors
  1. Kurt M. Anstreicher
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kurt M. Anstreicher.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anstreicher, K.M. On convex relaxations for quadratically constrained quadratic programming. Math. Program. 136, 233–251 (2012). https://doi.org/10.1007/s10107-012-0602-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-012-0602-3

Keywords

Mathematics Subject Classification

Search

Navigation