Modulus Methods for Nonnegatively Constrained Image Restoration

DOI10.1137/15M1045892zbMath1354.65035WikidataQ113079367 ScholiaQ113079367MaRDI QIDQ3179599

Junbin Gao, Jinghua Shen, Fujiao Ju, Jun-Liang Dong

Publication date: 19 December 2016

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/15m1045892

zbMATH Keywords

convergence; linear complementarity problem; numerical experiments; conjugate gradient method; symmetric positive definite matrix; nonnegative image restoration; modulus method; inexact iterative method; Karush-Kuhn-Tucker optimization conditions

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

65D18: Numerical aspects of computer graphics, image analysis, and computational geometry

94A08: Image processing (compression, reconstruction, etc.) in information and communication theory

Related Items

Improved Inexact Alternating Direction Methods for a Class of Nonlinear Complementarity Problems, 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, 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

Uses Software

• LSQR
• Regularization tools
• TRON
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On iterative algorithms for linear least squares problems with bound constraints
• Solving the minimal least squares problem subject to bounds on the variables
• Error bounds for the linear complementarity problem with a P-matrix
• An efficient computational method for total variation-penalized Poisson likelihood estimation
• Stopping rules for a nonnegatively constrained iterative method for ill-posed Poisson imaging problems
• A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Quasi-Newton approach to nonnegative image restorations
• Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems
• A non-monotonic method for large-scale non-negative least squares
• A modified modulus method for symmetric positive-definite linear complementarity problems
• Modulus-based matrix splitting iteration methods for linear complementarity problems
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Deblurring Images
• Improvement of Space-Invariant Image Deblurring by Preconditioned Landweber Iterations
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Iteration methods for convexly constrained ill-posed problems in hilbert space
• Numerical Optimization
• Projected Landweber method and preconditioning
• Engineering and Economic Applications of Complementarity Problems
• A Nonnegatively Constrained Convex Programming Method for Image Reconstruction
• Newton's Method for Large Bound-Constrained Optimization Problems
• Computational Methods for Inverse Problems
• Digital image deblurring with SOR
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints