Skip to main content
SpringerLink
Log in

Methods of unconditional minimization of functions using a simplex

  • Published:
Journal of Soviet Mathematics 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

Literature cited

  1. V. G. Karmanov, Mathematical Programming [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  2. D. M. Himmelblau, Applied Nonlinear Programming, McGraw-Hill (1971).

  3. A. N. Kolmogorov and S. V. Fomin, Elements of the Theory of Functions and Functional Analysis, Graylock (1965).

  4. R. Rockafellar, Convex Analysis, Princeton Univ. Press (1970).

Download references

Authors
  1. I. Ya. Zabotin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 7, pp. 55–64, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zabotin, I.Y. Methods of unconditional minimization of functions using a simplex. J Math Sci 43, 2454–2460 (1988). https://doi.org/10.1007/BF01095651

Download citation

  • Issue Date:

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

Search

Navigation