Skip to main content
SpringerLink
Log in

A descent method with the use of duality for the solution of a convex programming problem in a Hilbert space

  • 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. S. I. Zukhovitskii, R. A. Polyak, and M. E. Primak, “A numerical method for solving the problem of convex programming problem in a Hilbert space,” Dokl. Akad. Nauk SSSR,163, No. 2, 282–284 (1965).

    Google Scholar 

  2. R. A. Polyak, “Numerical methods for solving certain nonlinear programming problems,” Dissertation, Kiev (1966).

  3. J. Focke, “Dualitat beim Richtungsproblem von Zoutendijk,” Math. Operationsforsch. Statist.,2, No. 3, 213–219 (1971).

    Google Scholar 

  4. V. S. Izhutkin and A. N. Moloshnyuk, “Duality in the problem of the selection of the Zoutendijk direction in the case of nonlinear constraints,” in: Post-Graduates' Collection [in Russian], Kazan (1973).

  5. H. P. Kunzi and W. Krelle (in colloboration with W. Oettli), Nonlinear Programming, Blaisdell, Waltham, Mass. (1966).

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

    Google Scholar 

  7. E. G. Gol'shtein, Duality Theory in Mathematical Programming and Its Applications [in Russian], Nauka, Moscow (1971).

    Google Scholar 

Download references

Authors
  1. V. S. Izhutkin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. N. Moloshnyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Issledovaniya po Prikladnoi Matematike, No. 3, pp. 75–81, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Izhutkin, V.S., Moloshnyuk, A.N. A descent method with the use of duality for the solution of a convex programming problem in a Hilbert space. J Math Sci 41, 1411–1417 (1988). https://doi.org/10.1007/BF01097069

Download citation

  • Issue Date:

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

Keywords

Search

Navigation