Skip to main content
SpringerLink
Log in

Algebraic Solution of the Problems of Nonconvex Quadratic Programming

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

An algebraic approach founded on the Gröbner bases coupled with the necessary optimality conditions of the first order was used to solve the problem of nonconvex quadratic programming. Illustrative numerical examples were presented.

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. Pardalos, P. and Vavasis, S., Quadratic Programming with One Negative Eigenvalue is NP-hard, JOGO, 1991, no. 1, pp. 15-22.

  2. Floudas, C.A. and Visweswaran, V., Quadratic Optimization, in Handbook of Global Optimization, Dordrecht: Kluwer, 1995.

    Google Scholar 

  3. Shor, N.Z. and Stetsenko, S.I., Kvadratichnye ekstremal'nye zadachi i nedifferentsiruemaya optimizatsiya (Quadratic Extremal Problems and Nondifferentiable Optimization), Kiev: Naukova Dumka, 1989.

    Google Scholar 

  4. Ben-Tal, A. and Nemirovski, A., Lectures on Modern Convex Optimization, Philadelphia: SIAM, 2001.

    Google Scholar 

  5. Wolkowicz, H., Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems, in System Modelling and Optimization: Methods, Theory and Applications, Powell, M.J.D. and Sholtes, S., Eds., Boston: Kluwer, 1999.

    Google Scholar 

  6. Sherali, H.D., Adams, W.P., A Reformulization-linearization Technique for Solving Discrete and Continuous Nonconvex Problems, Dordrecht: Kluwer, 1998.

    Google Scholar 

  7. Konno, K., Thach, P.T., and Tuy, H., Optimization on Low Rank Nonconvex Structures, Dordrecht: Kluwer, 1997.

    Google Scholar 

  8. Horst, R., Pardalos, P., and Tuy, H., Introduction to Global Optimization, Dordrecht: Kluwer, 1995.

    Google Scholar 

  9. Hägglöf, K., Lindberg, P.O., and Svensson, L., Computing Global Minima to Polynomial Optimization Problems using Gröbner Bases, JOGO, 1995, no. 7, pp. 115-125.

  10. Galeev, E.T. and Tikhomirov, V.M., Optimizatsiya: teoriya, primery, zadachi (Optimization: Theory, Examples, Problems), Moscow: Editorial URSS, 2000.

    Google Scholar 

  11. . Cox, D., Little, J., and O'Shea, D., Ideals, Varieties, and Algorithms, New York: Springer, 1998. Translated under the title Idealy, mnogoobraziya i algoritmy, Moscow: Mir, 2000.

    Google Scholar 

  12. Tan Kiat Shi, Steeb, W.-H., and Hardy, Y., Symbolic C++: An Introduction to Computer Algebra using Object-Oriented Programming, London: Springer, 2000. Translated under the title Simvol'nyi S++: Vvedenie v komp'yuternuyu algebru s ispol'zovaniem ob"ektno-orientirovannogo programmirovaniya, Moscow: Mir, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Melentiev Energy Systems Institute, Siberian Branch, Russian Academy of Sciences, Irkutsk, Russia

    O. V. Khamisov

Authors
  1. O. V. Khamisov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khamisov, O.V. Algebraic Solution of the Problems of Nonconvex Quadratic Programming. Automation and Remote Control 65, 218–226 (2004). https://doi.org/10.1023/B:AURC.0000014718.51686.38

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:AURC.0000014718.51686.38

Keywords

Search

Navigation