A primal-dual iterative algorithm for a maximum likelihood estimation problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- A Statistical Model for Positron Emission Tomography
- A relaxed version of Bregman's method for convex programming
- An iterative row-action method for interval convex programming
- Convergence analysis for a multiplicatively relaxed EM algorithm
- Convex Analysis
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
- Optimization of Burg's entropy over linear constraints
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- The role of duality in optimization problems involving entropy functionals with applications to information theory
Cited in
(7)- On properties of the iterative maximum likelihood reconstruction method
- Generating structured nonsmooth priors and associated primal-dual methods
- A recursive algorithm for discrete L1 linear estimation using the dual simplex method
- Approximation and Online Algorithms
- A new smoothing-regularization approach for a maximum-likelihood estimation problem
- A primal-dual method for large-scale image reconstruction in emission tomography
- Interval underrelaxed bregman's method with an application
This page was built for publication: A primal-dual iterative algorithm for a maximum likelihood estimation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563617)