Skip to main content
SpringerLink
Log in

Convergence of a truncation method with deletion at each step

  • 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, “Methods of minimization in the presence of constraints,” Zh. Vychial. Mat. Mat. Fiz.,6, No. 5, 787–823 (1966).

    Google Scholar 

  2. J. E. Kelley, “The cutting-plane method for solving convex programs,” J. Soc. Ind. Appl. Math.,8, No. 4, 703–712 (1960).

    Google Scholar 

  3. D. M. Topkis, “Cutting-plane methods without nested constraint sets,” Oper. Res.,18, No. 3, 404–413 (1970).

    Google Scholar 

  4. M. E. Primak, “Convergence of a modified Chebyshev-center method in convex programming,” Kibernetika, No. 5, 100 (1977).

    Google Scholar 

  5. D. M. Salmon, “Minimax controller design,” in: 9th Joint Automat. Control Conf. Ann Arbor, Michigan (1968), pp. 495–500.

  6. I. K. Daraban, “A method of defining a minimax,” in: Mathematical Methods of Systems Research and Optimization [in Russian], Issue 4 (1970), pp. 37–41.

Download references

Authors
  1. M. E. Primak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp 119–121, January–February, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Primak, M.E. Convergence of a truncation method with deletion at each step. Cybern Syst Anal 16, 134–137 (1980). https://doi.org/10.1007/BF01099375

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation