Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Remarks on solutions to a nonconvex quadratic programming test problem

  • Short Communication
  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

A recent paper of Tuy and Hoai-Phuong published in JOGO (2007) 37:557–569 presents an algorithm for nonconvex quadratic programming with quadratic constraints. Performance of this algorithm is illustrated by solving, among others, a test problem from a paper of Audet, Hansen, Jaumard and Savard published in Mathematical Programming, Ser. A (2000) 87:131–152. This test problem is a reformulation of a problem from a paper of Dembo published in Mathematical Programming (1976) 10:192–213. Tuy and Hoai-Phuong observe that the optimal solution reported by Audet et al. is very far from the optimal one for this reformulation. The discrepancy between the reported optimal solutions is not due to selection of an almost feasible solution far from the optimal one nor to cumulation of termwise approximation errors. It is, in fact, simply due to a typographical error.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Audet C., Hansen P., Jaumard B., Savard G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Program. 87(1, Ser. A), 131–152 (2000)

    Google Scholar 

  2. Dembo R.: A set of geometric programming test problems and their solutions. Math. Program. 10(2), 192–213 (1976)

    Article  Google Scholar 

  3. Floudas, C.: Deterministic global optimization: theory, methods and applications. In: Nonconvex Optimization and Its Applications, vol. 37. Kluwer Acad. Publ., Dordrecht. http://www.springer.com/mathematics/book/978-0-7923-6014-8 (1999)

  4. Hansen P., Jaumard B., Lu S.H.: An analytical approach to global optimization. Math. Program. 52(2, Ser. B), 227–254 (1991)

    Article  Google Scholar 

  5. Perron, S.: Applications jointes de l’optimisation combinatoire et globale. Ph.D. thesis, École Polytechnique de Montréal (2004)

  6. Tuy H., Hoai-Phuong N.: A robust algorithm for quadratic optimization under quadratic constraints. J. Global Optim. 37(4), 557–569 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GERAD and École Polytechnique de Montréal, Montréal, Québec, H3C 3A7, Canada

    Charles Audet

  2. GERAD and HEC Montréal, Montréal, Québec, H3T 2A7, Canada

    Pierre Hansen & Sylvain Perron

  3. LIX, Ecole Polytechnique, Palaiseau, France

    Pierre Hansen

Authors
  1. Charles Audet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Hansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sylvain Perron
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sylvain Perron.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Audet, C., Hansen, P. & Perron, S. Remarks on solutions to a nonconvex quadratic programming test problem. J Glob Optim 50, 363–369 (2011). https://doi.org/10.1007/s10898-010-9586-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-010-9586-9

Keywords

Search

Navigation