This is a preview of subscription content, log in via an institution to check access.
Literature Cited
O. N. Tokareva, “On the use of quadratic programming problems for conditional optimization,” in: The Theory of Optimal Solutions [in Russian], Kiev (1979), pp. 54–63.
O. N. Tokareva, “On the convergence of algorithms on the basis of barrier functions with the use of quadratic programming problems,” VINITI dep. No. 1402-8, March 30, 1981.
A. V. Fiacco and G. P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, New York (1968).
M. R. Osborne and D. M. Ryan, “On penalty function methods for nonlinear programming problems,” J. Math. Anal. Appl.,31, 559–578 (1970).
J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York (1970).
M. C. Biggs, “On the convergence of some minimization algorithms based on recursive quadratic programming,” J. Inst. Math. Appl.,21, 67–81 (1978).
Additional information
Translated from Kibernetika, No. 5, pp. 107–112, September–October, 1981.
Rights and permissions
About this article
Cite this article
Tokareva, O.N. The estimates of the rate of convergence of algorithms based on barrier functions with the use of quadratic programming problems. Cybern Syst Anal 17, 688–695 (1981). https://doi.org/10.1007/BF01068792
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068792