Skip to main content
Log in

Minimization of functions constrained by equalities

  • Published:
Cybernetics Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literature Cited

  1. B. T. Polyak, “Certain dual methods for solving conditional extremum problems,” in: Proceedings of the Symposium on the Accuracy and Efficiency of Algorithms for Calculations [in Russian], Vol. 4, Izd. IK AN Ukr SSR, Kiev (1969).

    Google Scholar 

  2. Yu. M. Danilin, “Minimization methods based on the approximation of the original function by a convex one,” Zh. Vychisl. Matem. i Matem. Fiz., No. 5 (1970).

  3. Yu. M. Danilin and B. N. Pshenichnyi, “Minimization methods with accelerated convergence,” Zh. Vyshisl. Matem. i Matem. Fiz., No. 6 (1970).

  4. J. D. Pearson, “Variable metric methods of minimization,” Computer Journal, 12, No. 2 (1969).

  5. A. Miele, H. Y. Huang, and J. C. Heideman, “Sequential gradient-restoration algorithm for the minimization of constrained functions-ordinary and conjugate gradient versions,” J. Optim. Theory and Applic., 4, No. 4 (1969).

Download references

Authors

Additional information

Translated from Kibernetika, No. 2, pp. 88–95, March–April, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Danilin, Y.M. Minimization of functions constrained by equalities. Cybern Syst Anal 7, 308–316 (1971). https://doi.org/10.1007/BF01071804

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation