This is a preview of subscription content, log in via an institution to check access.
Literature Cited
R. Rockafellar, Convex Analysis, Princeton Univ. Press (1970).
B. Martinet, “Determination approchée d'un point fixe d'une application pseudocontractante,” C. R. Acad. Sci.,274, 163–165 (1972).
B. Martinet, “Regularisation d'inéquations variationelles par approximations successives,” Rev. Fr. Inf. Rech. Operat.,4, No. 3, 154–159 (1970).
A. S. Antipin, “On a convex programming method that uses a symmetric modification of a Lagrange function,” Ekonomika Mat. Metody,12, No. 6, 1164–1173 (1976).
R. T. Rockafellar, “Augmented Lagrangians and applications of the proximal point algorithm in convex programming,” Preprint 72-2269, Univ. of Washington, Seattle.
Ph. Wolfe, “A duality theorem for nonlinear programming,” Q. Appl. Math.,19, No. 3, 239–244 (1961).
P. Huard, “Programmation matématique convexe,” Rev. Inf. Rech. Operat.,7, 43–49 (1968).
Additional information
Mathematics Institute, Siberian Branch, Academy of Sciences of the USSR, Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 20, No. 2, pp. 307–316, March–April, 1979.
Rights and permissions
About this article
Cite this article
Kaplan, A.A. Iteration processes of convex programming with internal regularization. Sib Math J 20, 219–226 (1979). https://doi.org/10.1007/BF00970026
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00970026