A primal-dual iterative algorithm for a maximum likelihood estimation problem
- 1 November 1992
- journal article
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 14 (4) , 443-456
- https://doi.org/10.1016/0167-9473(92)90060-s
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Convergence analysis for a multiplicatively relaxed EM algorithmMathematical Methods in the Applied Sciences, 1991
- On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming MethodSIAM Journal on Optimization, 1991
- 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 relaxed version of Bregman's method for convex programmingJournal of Optimization Theory and Applications, 1986
- A Statistical Model for Positron Emission TomographyJournal of the American Statistical Association, 1985
- Mixture Densities, Maximum Likelihood and the EM AlgorithmSIAM Review, 1984
- 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
- 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