Skip to main content
SpringerLink
Log in

Method of nonsmooth penalty functions and the theory of extremum problems in Banach space

  • Published:
Cybernetics Aims and scope

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. V. Fedorov, Maximin Seeking Methods [in Russian], Moscow State Univ., Moscow (1975).

    Google Scholar 

  2. A. V. Finkel'shtein, “Necessary optimality conditions for generalized solutions and the method of penalty functionals,” Ekonomika Mat. Metody, 2, No. 4 (1975).

  3. W. I. Zangwill, Nonlinear Programming, Prentice-Hall, Englewood Cliffs, New Jersey (1969).

    Google Scholar 

  4. I. I. Eremin and N. N. Astaf'ev, Introduction to the Theory of Linear and Convex Programming [in Russian], Nauka, Moscow (1976).

    Google Scholar 

  5. V. I. Venets, “Saddle point of the Lagrange function and nonsmooth penalty functions in convex programming,” Avtom. Telemekh., No. 8 (1974).

Download references

Authors
  1. V. V. Beresnev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 100–105, September–October, 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beresnev, V.V. Method of nonsmooth penalty functions and the theory of extremum problems in Banach space. Cybern Syst Anal 15, 712–718 (1979). https://doi.org/10.1007/BF01071224

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation