Skip to main content
SpringerLink
Log in

New optimality conditions for quadratic optimization problems with binary constraints

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In this article, we obtain new sufficient optimality conditions for the nonconvex quadratic optimization problems with binary constraints by exploring local optimality conditions. The relation between the optimal solution of the problem and that of its continuous relaxation is further extended.

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

Similar content being viewed by others

References

  1. de Angelis P.L., Pardalos P.M., Toraldo G.: Quadratic problems with box constraints. In: Bomze, I.M., Csendes, T., HorstR. Pardalos, P.M. (eds) Developments in Global Optimization., pp. 73–93. Kluwer, Dordrecht (1997)

    Google Scholar 

  2. Beck A., Teboulle M.: Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J. Optim. 11(1), 179–188 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Gould N.I.M., Lucidi S., Roma M., Toint P.L.: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9(2), 504–525 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. Hansen P., Jaumard B., Ruiz M., Xiong J.: Global minimization of indefinite quadratic functions subject to box constraints. Nav. Res. Log. 40, 373–392 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Moré J.J., Sorensen D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4(3), 553–572 (1983)

    Article  MATH  Google Scholar 

  6. Pardalos, P.M., Wolkowicz, H. (eds.): Topics in Semidefinite and Interior-Point Methods. Fields Institute Communications Series, vol. 18. American Mathematical Society, Providence (1998)

  7. Pardalos P.M., Ramana M.: Semidefinite programming. In: Terlaky, T. (eds) Interior Point Methods of Mathematical Programming., pp. 369–398. Kluwer, Dordrecht (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, LMIB of the Ministry of Education, Beihang University, 100083, Beijing, People’s Republic of China

    Yong Xia

  2. CIAS, Central University of Finance and Economics, 100081, Beijing, People’s Republic of China

    Yong Xia

Authors
  1. Yong Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yong Xia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xia, Y. New optimality conditions for quadratic optimization problems with binary constraints. Optim Lett 3, 253–263 (2009). https://doi.org/10.1007/s11590-008-0105-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-008-0105-6

Keywords

Search

Navigation