This is a preview of subscription content, log in via an institution to check access.
Literature Cited
J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, Academic Press (1970).
B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods in Extremal Problems [in Russian], Nauka, Moscow (1975).
F. P. Vasil'ev, Numberical Methods of Solving Extremal Problems [in Russian], Nauka, Moscow (1980).
F. Gill and W. Murray (eds.), Numerical Methods of Constrained Optimization [Russian translation], Mir, Moscow (1977).
V. M. Panin, “On global convergence of second-order methods for the convex discrete min-max problem,” Kibernetika, No. 5, 95–99 (1980).
A. V. Fiacco and G. P. McCormick, Nonlinear Programming, Wiley (1968).
F. H. Klarke, “A new approach to Lagrange multipliers,” Math. Oper. Res.,1, No. 2, 165–174 (1976).
I. I. Eremin and N. N. Astaf'ev, Introduction to Theory of Linear and Convex Programming [in Russian], Nauka, Moscow (1976).
S. P. Han, “A globally convergent method for nonlinear programming,” J. Optim. Theory Appl.,22, No. 3, 297–309 (1977).
V. M. Panin, “On some methods for solving convex programming problems,” Zh. Vychisl. Mat. Mat. Fiz.,21, No. 2, 315–328 (1981).
D. Q. Mayne and N. Maratos, “A first-order exact penalty function algorithm for equality constrained optimization problems,” Math. Progr.,16, No. 3, 303–325 (1979).
V. M. Panin, “Global convergence of damped Newton's method in convex programming problems,” Dokl. Akad. Nauk SSSR,261, No. 4, 811–814 (1981).
Yu. M. Danilin, V. M. Panin, and B. N. Pshenichnyi, “A modified linearization method,” Kibernetika, No. 5, 70–73 (1982).
Yu. M. Danilin and V. M. Panin, “On some methods for seeking saddle-points,” Kibernetika, No. 3, 119–124 (1974).
Yu. M. Danilin and V. A. Morar'. “Quasi-Newton methods of constrained optimization,” Kibernetika, No. 5, 80–86 (1979).
G. di Pillo and L. Grippo, “A new class of augmented Lagrangian in nonlinear programming,” SIAM J. Control Optim.,17, No. 5, 618–628 (1979).
S. P. Han and O. L. Mangasarian, “Exact penalty functions in nonlinear programming,” Math. Progr.,17, No. 3, 251–269 (1979).
E. Polak, “On the global stabilization of locally convergent algorithms,” Automatica,12, No. 4, 337–342 (1976).
F. P. Vasil'ev and M. D. Yachimovich, “On iterative regularization of Newton's method,” Zh. Vychisl. Mat. Mat. Fiz.,21, No. 3, 775–778 (1981).
B. N. Pshenichnyi and L. A. Sobolenko, “Acceleration of convergence of linearization method for constrained minimization problem,” Zh. Vychisl. Mat. Mat. Fiz.,20, No. 3, 605–614 (1980).
Additional information
Translated from Kibernetika, No. 2, pp. 53–56, March–April, 1983.
Rights and permissions
About this article
Cite this article
Panin, V.M. Use of a finite penalty in convex programming problems for global convergence of Newton's method with steep adjustment. Cybern Syst Anal 19, 212–217 (1983). https://doi.org/10.1007/BF01072022
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01072022