Skip to main content
SpringerLink
Log in

Algorithm for the simultaneous solution of the direct and dual problem of convex programming in a 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. E. S. Levitin and B. T. Polyak, “Constrained minimization methods” Zh. Vychisl. Matem. i Matem. Fiz.6, No. 5 (1966).

    Google Scholar 

  2. V. F. Dem'yanov and A. M. Rubinov, Approximate Methods for the Solution of Extremal Problems [in Russian], Izd. Leningradsk. Gos. Univ. (1968).

  3. E. S. Levitin, “A generalized minimization method for unsmooth extremal problems,” Zh. Vychisl. Matem. i Matem. Fiz.,9, No. 4 (1969).

  4. N. E. Rodnishchev, “The method of feasible directions in the problems of optimization of stochastic systems,” Izv. Akad. Nauk SSSR, Tekhn. Kibernetika, No. 1 (1972).

  5. S. L. Zukhovitskii, R. A. Polyak, and M. E. Primak, “A numerical method for solving the convex programming problem in a Hilbert space,” Dokl Akad. Nauk SSSR,163, No. 2, (1965).

  6. K. Yosida, Functional Analysis, Springer-Verlag, New York (1964).

    Google Scholar 

  7. B. N. Pshenichnyi, Necessary Conditions for an Extremum, Mareel Dekker Inc., New York (1971).

    Google Scholar 

  8. E. G. Gol'shtein, “Dual problems of convex and fractional-convex programming in functional spaces,” in: Studies in Mathematical Programming [in Russian], Nauka, Moscow (1968).

    Google Scholar 

  9. V. O. Gnatyuk, “A numerical method of solving an extremal problem in a Banach space,” Dokl. Akad. Nauk URSR, Series A, No. 4 (1970).

  10. V. A. Gnatyuk, “A numerical method for solving the convex programming problem in a Banach space,” in: Proceedings of the Third Republican Scientific Conference of Young Researchers in Cybernetics [in Russian], Vol. 2, Kiev (1968).

Download references

Authors
  1. V. A. Gnatyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 102–107, January–February, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gnatyuk, V.A. Algorithm for the simultaneous solution of the direct and dual problem of convex programming in a Banach space. Cybern Syst Anal 11, 114–121 (1975). https://doi.org/10.1007/BF01069955

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation