Abstract
A new type of relaxation for Bregman's method, an iterative primal-dual algorithm for linearly constrained convex programming, is presented. It is shown that the new relaxation procedure generalizes the usual concept of relaxation and preserves the convergence properties of Bregman's algorithm for a suitable choice of the relaxation parameters. For convergence, Bregman's method requires that the objective function satisfy certain conditions. A sufficient and easily checkable condition for these requirements to hold is also given.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Lamond, B., andStewart, N. F.,Bregman's Balancing Method, Transportation Research, Vol. 15B, pp. 239–248, 1981.
Herman, G. T., andLent, A.,A Family of Iterative Quadratic Optimization Algorithms for Pairs of Inequalities, with Application in Diagnostic Radiology, Mathematical Programming Study, Vol. 9, pp. 15–29, 1978.
Herman, G. T., andLent, A.,Iterative Reconstruction Algorithms, Computers in Biology and Medicine, Vol. 6, pp. 273–294, 1976.
Censor, Y.,Row-Action Methods for Huge and Sparse Systems and Their Applications, SIAM Review, Vol. 23, pp. 444–464, 1981.
Bregman, L. M.,The Relaxation Method of Finding the Common Point of Convex Sets and Its Application to the Solution of Problems in Convex Programming, USSR Computational Mathematics and Mathematical Physics, Vol. 7, pp. 200–217, 1967.
Censor, Y., andLent, A.,An Iterative Row-Action Method for Interval Convex Programming, Journal of Optimization Theory and Applications, Vol. 34, pp. 321–353, 1981.
Herman, G. T., Lent, A., andLutz, P. H.,Relaxation Methods for Image Reconstruction, Communications of the Association for Computing Machinery, Vol. 21, pp. 152–158, 1978.
Lent, A., andCensor, Y.,Extensions of Hildreth's Row-Action Method for Quadratic Programming, SIAM Journal on Control and Optimization, Vol. 18, pp. 444–454, 1980.
Ortega, J. M., andRheinboldt, W. S.,Iterative Solutions of Nonlinear equations in Several Variables, Academic Press, New York, New York, 1970.
Author information
Authors and Affiliations
Additional information
Communicated by O. L. Mangasarian
Rights and permissions
About this article
Cite this article
De Pierro, A.R., Iusem, A.N. A relaxed version of Bregman's method for convex programming. J Optim Theory Appl 51, 421–440 (1986). https://doi.org/10.1007/BF00940283
Issue Date:
DOI: https://doi.org/10.1007/BF00940283