Modulus methods for nonnegatively constrained image restoration
From MaRDI portal
conjugate gradient methodconvergenceinexact iterative methodKarush-Kuhn-Tucker optimization conditionslinear complementarity problemmodulus methodnonnegative image restorationnumerical experimentssymmetric positive definite matrix
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Recommendations
- Modulus-based iterative methods for constrained Tikhonov regularization
- Modulus-based iterative methods for constrained \(\ell_p\)-\(\ell_q\) minimization
- Quasi-Newton approach to nonnegative image restorations
- Modular solvers for image restoration problems using the discrepancy principle
- Projected Barzilai-Borwein method for large-scale nonnegative image restoration
Cites work
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- A modified modulus method for symmetric positive-definite linear complementarity problems.
- A non-monotonic method for large-scale non-negative least squares
- A Nonnegatively Constrained Convex Programming Method for Image Reconstruction
- An efficient computational method for total variation-penalized Poisson likelihood estimation
- Computational Methods for Inverse Problems
- Deblurring Images
- Digital image deblurring with SOR
- Engineering and Economic Applications of Complementarity Problems
- Error bounds for the linear complementarity problem with a P-matrix
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- scientific article; zbMATH DE number 3868512 (Why is no real title available?)
- scientific article; zbMATH DE number 1194487 (Why is no real title available?)
- scientific article; zbMATH DE number 49594 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 53613 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 803211 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 1433445 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Improvement of Space-Invariant Image Deblurring by Preconditioned Landweber Iterations
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Modulus-based matrix splitting iteration methods for linear complementarity problems.
- Modulus-type inner outer iteration methods for nonnegative constrained least squares problems
- Newton's Method for Large Bound-Constrained Optimization Problems
- Numerical Optimization
- On iterative algorithms for linear least squares problems with bound constraints
- Projected Landweber method and preconditioning
- Quasi-Newton approach to nonnegative image restorations
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Solving the minimal least squares problem subject to bounds on the variables
- Stopping rules for a nonnegatively constrained iterative method for ill-posed Poisson imaging problems
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
Cited in
(16)- Quasi-Newton approach to nonnegative image restorations
- On the convergence of modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problems with H_+-matrices
- Convergence analysis of modulus-based matrix splitting iterative methods for implicit complementarity problems
- A modified modulus-based multigrid method for linear complementarity problems arising from free boundary problems
- A modulus-based iterative method for sparse signal recovery
- A variant of two-step modulus-based matrix splitting iteration method for retinex problem
- A class of modified modulus-based synchronous multisplitting iteration methods for linear complementarity problems
- Column-oriented algebraic iterative methods for nonnegative constrained least squares problems
- Two-step modulus-based matrix splitting iteration methods for retinex problem
- Improved inexact alternating direction methods for a class of nonlinear complementarity problems
- Modular solvers for image restoration problems using the discrepancy principle
- An improved block modulus method for diagonally dominant linear complementarity problems
- Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems
- A modulus iteration method for non-negatively constrained TV image restoration
- The Order-p Tensor Linear Complementarity Problem for Images Deblurring
- A modulus iteration method for nonnegatively constrained photoacoustic image reconstruction
This page was built for publication: Modulus methods for nonnegatively constrained image restoration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179599)
