This is a preview of subscription content, log in via an institution to check access.
Literature Cited
B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods in Extremal Problems [in Russian], Nauka, Moscow (1975).
V. M. Panin, “Finite penaty method with a linear approximation of the constraints. II,” Kibernetika, No. 4, 73–81 (1984).
V. A. Daugavet and V. N. Malozenov, “The quadratic rate of convergence of a linearization method for solving discrete minimax problems,” Zh. Vychisl. Mat. Mat. Fiz.,21, No. 4, 835–843 (1981).
I. I. Eremin and N. N. Astaf'ev, Introduction to the Theory of Linear and Convex Programming [in Russian], Nauka, Moscow (1976).
R. Fletcher, “Penalty functions,” in: Mathematical Programming: The State of the Art Springer, Berlin (1983), pp. 81–114.
S. P. Han and O. L. Mangasarian, “Exact penalty functions in nonlinear programing,” Math. Programming,17, No. 3, 251–269 (1979).
Additional information
Translated from Kibernetika, No. 5, pp. 43–46, September–October, 1986.
Rights and permissions
About this article
Cite this article
Danilin, Y.M., Kovnir, V.N. Exact penalty function for nonlinear programming problems. Cybern Syst Anal 22, 585–590 (1986). https://doi.org/10.1007/BF01068354
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068354