This is a preview of subscription content, log in via an institution to check access.
References
P. Wolfe, Recent Developments in Nonlinear Programming, 1962.
T. Pietrzykowski, “On an iteration method for maximizing a concave function on a convex set,” Prace ZAM, ser. A, no. 13, 1961.
T. Pietrzykowski, “On a method of approximative finding conditional maximus,” Algorythmy, vol. no. 1, 1962.
A. V. Fiacco and G. P. McCormick, “The sequential unconstrained minimization technique for nonlinear programming, a primal-dual method,” Manag. Sci., 10, no. 2, 1964.
N. P. Buslenko, and G. A. Sokolov, “On a class of problems of optimal distribution,” Ekonomika i matematicheskie metody, vol. 1, no. 1, Moscow, 1965.
M. V. Rybashov, “The gradient method of solving problems of convex programming on an electronic model,” Avtomatika i telemekhanika, vol. 26, no. 11, Moscow, 1965.
D. B. Yudin and E. G. Gol'shtein, Problems and Methods of Linear Programming [in Russian], Moscow, 1964.
Okamura Kiychisa, “Some mathematical theory of the penalty method for solving optimum control problems,” J. Soc. Industr. and Appl. Math., A 2, no. 3, 1965.
G. Zoutendijk, Methods of Feasible Directions [Russian translation], IL, Moscow, 1963.
A. J. Hoffman, “On approximate solutions of systems of linear inequalities,” J. Res. Nat. Bur. Standards, 49, no. 4, 1952.
Additional information
Kibernetika, Vol. 3, No. 4, pp. 63–67, 1967
Rights and permissions
About this article
Cite this article
Eremin, I.I. The penalty method in convex programming. Cybern Syst Anal 3, 53–56 (1967). https://doi.org/10.1007/BF01071708
Issue Date:
DOI: https://doi.org/10.1007/BF01071708