On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
- 1 August 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 1 (3) , 401-423
- https://doi.org/10.1137/0801025
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Optimization of Burg's entropy over linear constraintsApplied Numerical Mathematics, 1991
- The role of duality in optimization problems involving entropy functionals with applications to information theoryJournal of Optimization Theory and Applications, 1988
- A Simultaneous Iterative Method for Computing Projections on PolyhedraSIAM Journal on Control and Optimization, 1987
- A relaxed version of Bregman's method for convex programmingJournal of Optimization Theory and Applications, 1986
- Entropy in linear programsMathematical Programming, 1981
- Row-Action Methods for Huge and Sparse Systems and Their ApplicationsSIAM Review, 1981
- An iterative row-action method for interval convex programmingJournal of Optimization Theory and Applications, 1981
- Generalized Iterative Scaling for Log-Linear ModelsThe Annals of Mathematical Statistics, 1972
- 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
- A quadratic programming procedureNaval Research Logistics Quarterly, 1957