Skip to main content
SpringerLink
Log in

A method for sequential absolute minimization in mathematical programming problems

  • 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. A. V. Fiacco and G. P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, New York (1968).

    Google Scholar 

  2. F. P. Vasil'ev, Lectures on Methods for the Solution of Extremal Problems [in Russian], Izd. Mosk. Univ. (1974).

  3. E. Polak, Computational Methods in Optimization: A Unified Approach, Academic Press, New York (1971).

    Google Scholar 

  4. B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods in Extremal Problems [in Russian], Nauka, Moscow (1975).

    Google Scholar 

  5. B. T. Polyak, “Iterative methods using the Lagrange multiplier to solve extremal problems with constraints in the form of equalities,” Zh. Vychisl. Mat. Mat. Fiz.,10, No. 5 (1970).

  6. V. V. Ivanov, Algorithms for the Solution of Nonlinear Programming Problems [in Russian], Kievsk. Dom Nauchno-Tekh. Propagandy, Kiev (1963).

    Google Scholar 

  7. V. V. Ivanov and V. E. Truten', “On the method of penalty function”, Kibernetikia, No. 2 (1968).

  8. T. Glad, Lagrange Multiplier Methods for Minimization under Equality Constraints, Report 7323, Institute of Technology, Lund (1973).

    Google Scholar 

  9. E. G. Gol'shtein and N. V. Tret'yakov, “The modified Lagrange function,” Ékonom. Mat. Metody, No. 3 (1974).

  10. Yu. P. Ivanilov, “Two algorithms for the solution of concave programs,” in: Optimal Decision Theory [in Russian], Vol. 4, Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1969).

    Google Scholar 

  11. D. D. Morrison, “Optimization by least squares,” SIAM J. Numer. Anal.,5, No. 1 (1968).

    Google Scholar 

  12. J. Kowalik, M. R. Osborne, and D. M. Ryan, “A new method for constrained optimization problems,” Operat. Res.,17, No. 6 (1969).

    Google Scholar 

  13. Yu. B. Germeier and I. A. Krylov, “Maximum search by the method of ‘discrepancies,’” Zh. Vychisl. Mat. Mat. Fiz.,12, No. 4 (1972).

    Google Scholar 

  14. V. E.Truten', “Analysis of the precision of convex programs,” Kibernetika, No. 6 (1971).

  15. V. V. Ivanov and V. E. Truten', “Analysis of the precision of quadratic programs,” Kibernetika, No. 4 (1969).

  16. N. Z. Shor, “Generalized gradient methods for the minimization of nonsmooth functions and their application to mathematical programming problems,” Ékonom. Mat. Metody, No. 2 (1976).

  17. M. D. Maergoiz, “Application of the generalized Aitken-Steffensen method to function minimization,” Sibirsk. Mat. Zh.,13, No. 1 (1972).

    Google Scholar 

  18. Yu. M. Krivonos and B. A. Galanov, “A method of differential descent,” Diff. Uravn.,5, No. 8 (1969).

    Google Scholar 

  19. V. K. Saul'ev and I. I. Samoilova, “Approximate methods of unconstrained optimization of functions of many variables (survey),” in: Mathematical Analysis [in Russian], Vol. 11, VINITI, Moscow (1973).

    Google Scholar 

  20. V. V. Ivanov, The Theory of Approximate Methods and Its Application to the Numerical Solution of Singular Integral Equations [in Russian], Naukova Dumka, Kiev (1968).

    Google Scholar 

  21. V. V. Ivanov and K. Dzhumaev, “Stability and rate of convergence of certain algorithms of conjugate directions for the minimization of functions,” Kibernetika, No. 4 (1974).

  22. V. G. Karmanov, “An approach to the investigation of convergence of minimization relaxation processes,” Zh. Vychisl. Mat. Mat. Fiz.,14, No. 6 (1974).

  23. Yu. I. Lyubich and G. D. Maistrovskii, “A general theory of relaxation processes for convex functionals,” Usp. Mat. Nauk,25, No. 1 (1970).

    Google Scholar 

  24. V. V. Ivanov, “Optimal algorithms for the minimization of certain classes of functions,” Kibernetika, No. 4 (1972).

  25. G. D. Maistrovskii, “On the optimality of Newton's method,” Dok. Akad. Nauk SSSR,204, No. 6 (1972).

    Google Scholar 

  26. R. Brent, S. Winograd, and P. Wolfe, “Optimal iterative process for root-finding,” Numerische Math.,20 (1973).

  27. A. A. Goldstein and J. F. Prise, “On descent from local minima,” Math. Comput.,25, No. 115 (1971).

    Google Scholar 

  28. T. L. Saaty, Optimization in Integers and Related Extremal Problems, McGraw-Hill, New York (1970).

    Google Scholar 

Download references

Authors
  1. V. V. Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Lyudvichenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 1–8, March–April, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ivanov, V.V., Lyudvichenko, V.A. A method for sequential absolute minimization in mathematical programming problems. Cybern Syst Anal 13, 143–151 (1977). https://doi.org/10.1007/BF01073300

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation