A Kronecker approximation with a convex constrained optimization method for blind image restoration
From MaRDI portal
Publication:694158
DOI10.1007/s11590-011-0370-7zbMath1259.90091OpenAlexW2083582143MaRDI QIDQ694158
Khalide Jbilou, Abderrahman Bouhamidi
Publication date: 11 December 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0370-7
Related Items (4)
Polynomial computations for blind image deconvolution ⋮ An iteration method to solve multiple constrained least squares problems ⋮ A numerical method on the mixed solution of matrix equation \(\sum_{i = 1}^t A_i X_i B_i = E\) with sub-matrix constraints and its application ⋮ An efficient method for solving a matrix least squares problem over a matrix inequality constraint
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- Kronecker product and SVD approximations in image restoration
- The gradient projection method with exact line search
- A gradient-based continuous method for large-scale optimization problems
- Regularization methods for the stable solution of inverse problems
- Algorithms with high order convergence speed for blind source extraction
- A bilinear algorithm for sparse representations
- Two-Point Step Size Gradient Methods
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On the Goldstein-Levitin-Polyak gradient projection method
- Bayesian Methods in Nonlinear Digital Image Restoration
- Blind Deconvolution Using a Regularized Structured Total Least Norm Algorithm
- Inexact spectral projected gradient methods on convex sets
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Kronecker Product Approximations forImage Restoration with Reflexive Boundary Conditions
- A Nonmonotone Line Search Technique for Newton’s Method
- On the Barzilai and Borwein choice of steplength for the gradient method
- Algorithm 813
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Convex programming in Hilbert space
This page was built for publication: A Kronecker approximation with a convex constrained optimization method for blind image restoration
