Skip to main content
Log in

Class of global minimum bounds of polynomial functions

  • Published:
Cybernetics Aims and scope

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

Access this article

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

Instant access to the full article PDF.

Literature Cited

  1. N. Z. Shor and A. S. Davydov, “On a bounding method for quadratic extremal problems with 0–1 variables,” Kibernetika, No. 2, 48–50 (1985).

    Google Scholar 

  2. N. Z. Shor, “Quadratic optimization problems,” Tekh. Kibern., No. 1, 128–139 (1987).

    Google Scholar 

  3. D. Hilbert, “Über die darstellung definiter Formen als Summen von Formen quadraten,” Math. Ann.,22, 342–350 (1888).

    Google Scholar 

  4. P. A. Aleksandrov (ed.), Hilbert Problems [in Russian], Nauka, Moscow (1969).

    Google Scholar 

  5. E. Artin, “Über die Zerlegung definiter Funktionen in Quadrate,”5, 100–115 (1927).

  6. R. Stone, “Linear complementarity problems with an invariant number of solutions,” Math. Progr.,34, No. 3, 265–291 (1986).

    Google Scholar 

  7. P. M. Pardalos, J. H. Glick, and J. B. Rosen, “Global minimization of indefinite quadratic problems,” Preprint, Pennsylvania State Univ., NCS-85-31 (1985).

  8. N. Z. Shor, “One approach to finding global extrema in polynomial mathematical programming problems,” Kibernetika, No. 5, 102–106 (1987).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 6, pp. 9–11, November–December, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shor, N.Z. Class of global minimum bounds of polynomial functions. Cybern Syst Anal 23, 731–734 (1987). https://doi.org/10.1007/BF01070233

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01070233

Keywords

Navigation