A fast quadratic programming algorithm for positive signal restoration
From MaRDI portal
Recommendations
- A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.
- Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms
- Stabilized Reconstruction in Signal and Image Processing
- scientific article; zbMATH DE number 503467
- Quasi-Newton approach to nonnegative image restorations
Cited in
(6)- Split proximal linearized algorithm and convergence theorems for the split DC program
- On the convergence of splitting algorithm for mixed equilibrium problems on Hadamard manifolds
- Hybrid Moreau’s Proximal Algorithms and Convergence Theorems for Minimization Problems in Hilbert Spaces with Applications
- Algorithms and Convergence Theorems for Mixed Equilibrium Problems in Hilbert Spaces
- A forward-backward algorithm for the DC programming in Hilbert spaces
- Hybrid inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces with applications
This page was built for publication: A fast quadratic programming algorithm for positive signal restoration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5187104)