A relaxed version of Bregman's method for convex programming
- 1 December 1986
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 51 (3) , 421-440
- https://doi.org/10.1007/bf00940283
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSIAM Review, 1981
- Bregman's balancing methodTransportation Research Part B: Methodological, 1981
- An iterative row-action method for interval convex programmingJournal of Optimization Theory and Applications, 1981
- Extensions of Hildreth’s Row-Action Method for Quadratic ProgrammingSIAM Journal on Control and Optimization, 1980
- Relaxation methods for image reconstructionCommunications of the ACM, 1978
- A family of iterative quadratic optimization algorithms for pairs of inequalities, with application in diagnostic radiologyPublished by Springer Nature ,1978
- Iterative reconstruction algorithmsComputers in Biology and Medicine, 1976
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967