Skip to main content
SpringerLink
Log in

COAP 2009 best paper award

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

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

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Axioma Inc. http://www.axioma.com

  3. Belotti, P.: Disjunctive cuts for non-convex MINLP. In: IMA Volume Series. Springer, Berlin (2010). URL http://myweb.clemson.edu/~pbelott/papers/belotti-disj-MINLP.pdf

    Google Scholar 

  4. Buchheim, C., Wiegele, A.: Semidefinite relaxations for non-convex quadratic mixed-integer programming. Manuscript, Alpen-Adria-Universitaet Klagenfurt, Klagenfurt, Austria, September 2010

  5. Burer, S.: Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math. Program. Comput. 2(1), 1–19 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  6. Burer, S., Vandenbussche, D.: Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16(3), 726–750 (2006)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Lovász, L., Schrijver, A.: Cones of matrices and setfunctions, and 0-1 optimization. SIAM J. Optim. 1, 166–190 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. Monteiro, R.D.C.: First- and second-order methods for semidefinite programming. Math. Program. 97, 209–244 (2003)

    MATH  MathSciNet  Google Scholar 

  10. Povh, J., Rendl, F., Wiegele, A.: A boundary point method to solve semidefinite programs. Computing 78(3), 277–286 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. QAPLIB. http://www.seas.upenn.edu/qaplib/

  12. Saxena, A., Bonami, P., Lee, J.: Convex relaxations of mixed integer quadratically constrained programs: extended formulations. Math. Program. 124(1–2), 383–411 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  13. Vandenbussche, D., Nemhauser, G.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3), 531–557 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  14. Vandenbussche, D., Nemhauser, G.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3), 559–575 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented Lagrangian methods for semidefinite programming. Manuscript, Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, USA (2009)

  16. Zhao, X.Y., Sun, D.F., Toh, K.C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20, 1737–1765 (2010)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

About this article

Cite this article

COAP 2009 best paper award. Comput Optim Appl 47, 567–570 (2010). https://doi.org/10.1007/s10589-010-9368-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-010-9368-9

Search

Navigation