References
A. Fiacco and G. MacCormack,Nonlinear Programming [Russian translation], Mir, Moscow (1972).
D. Bert-sekas,Conditional Optimization and Lagrange-Multiplier Methods [in Russian], Radio i Svyaz’, Moscow (1987).
B. T. Polyak,Introduction to Optimization [in Russian], Nauka, Moscow (1983).
Yu. M. Danilin, “Quadratic-penalty methods based on linear approximation,“Zh. Vychsil. Mat. Mat. Fiz.,29, No. 6, 831–843 (1989).
B. N. Pshenichnyi,A Linearization Method [in Russian], Nauka, Moscow (1983).
Yu. M. Danilin, “Gradient method for minimization of nonsmooth penalty functions,“Kibernetika, No. 4, 104–114, 125 (1988).
M. S. Biggs, “Constrained minimization using recursive equality constrained quadratic programming,“ in:Numerical Methods for Nonlinear Optimization, F. A. Lootsma (ed.), Academic Press, New York (1972), pp. 411–428.
P. E. Gill, W. Murray, M. A. Saunders, et al., “Recent developments in constrained optimization,“Numerical Algorithm Group, Newsletter, No. 1 (1984).
C. G. Broyden and N. F. Attia, “Penalty functions, Newton's method, and quadratic programming,“J. Opt. Theory. Appl.,58, No. 3, 377–385 (1988).
P. Gill, W. Murray, and M. Right,Practical Optimization [Russian translation], Mir, Moscow (1985).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 40–54, July–August, 1993.
Rights and permissions
About this article
Cite this article
Danilin, Y.M. Linearization method using smooth penalties. Cybern Syst Anal 29, 500–513 (1993). https://doi.org/10.1007/BF01125864
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01125864