Preview
Unable to display preview. Download preview PDF.
References
Antipin A.C., Method of regularization in convex programming. Economics and Mathematical Methods 11 (2)(1975) 336–342 (in Russian).
Gol'shtein E.G., Tretyakov N.V., The gradient method of minimization and algorithms of convex programming based on modefied Lagrangian functions. Economics and Mathematical Methods 11 (4) (1975) 730–742 (in Russian).
Powell M.J.D., Algorithms for nonlinear constraints that use Langrange functions. Mathematical Programming 14 (1978) 224–248.
Rockafellar R.T., Monotone operators and the proximal point algorithm. SIAM J. Control Opt. 14 (1976) 877–898.
Sosnowski J.S., Linear programming via augmented Lagrangians and conjugate gradient method, presented at International Conference on Methods of Mathematical Programming, Zakopane, Poland, 1977.
Sosnowski J.S., Dynamic optimization of multisector linear production model. Systems Research Institute, Warszawa, Ph.D. Thesis 1978 /in Polish/.
Tikhonov A.A., Arsenin V.Y., Methods of solution in correct problems. Nauka Moscow 1974.
Wierzbicki A.P., A quadratic approximation method based on augmented Lagrangian functions for nonconvex nonlinear programming problems. IIASA WP-78-61, Laxenburg, Austria, 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag
About this paper
Cite this paper
Sosnowski, J.S. (1980). Method of regularized approximations and its application to convex programming. In: Iracki, K., Malanowski, K., Walukiewicz, S. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006594
Download citation
DOI: https://doi.org/10.1007/BFb0006594
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10081-2
Online ISBN: 978-3-540-38253-9
eBook Packages: Springer Book Archive