Conditional gradient Tikhonov method for a convex optimization problem in image restoration

DOI10.1016/j.cam.2013.06.011zbMath1291.94009OpenAlexW2040236138MaRDI QIDQ2252731

Khalide Jbilou, Rentsen Enkhbat, Abderrahman Bouhamidi

Publication date: 23 July 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.06.011

zbMATH Keywords

optimizationconvex programmingTikhonov regularizationimage restorationdiscrete ill-posed problem

Mathematics Subject Classification ID

Convex programming (90C25) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items

Estimates for the generalized cross-validation function via an extrapolation and statistical approach, Preconditioning Toeplitz-plus-diagonal linear systems using the Sherman-Morrison-Woodbury formula, A conditional gradient method for primal-dual total variation-based image denoising, Structure Preserving Quaternion Biconjugate Gradient Method, Tensor form of GPBiCG algorithm for solving the generalized Sylvester quaternion tensor equations, On the minimum-norm least squares solution of the complex generalized coupled Sylvester matrix equations, Approximation of the Tikhonov regularization parameter through Aitken's extrapolation, Conditional gradient method for double-convex fractional programming matrix 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, Tensorial conditional gradient method for solving multidimensional ill-posed problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex constrained optimization for large-scale generalized Sylvester equations
• A reduced Newton method for constrained linear least-squares problems
• An interior-point method for large constrained discrete ill-posed problems
• Kronecker product and SVD approximations in image restoration
• Regularization methods for large-scale problems
• Tikhonov regularization and the L-curve for large discrete ill-posed problems
• GMRES, L-curves, and discrete ill-posed problems
• Tikhonov regularization with nonnegativity constraint
• Estimation of the \(L\)-curve via Lanczos bidiagonalization
• Sylvester Tikhonov-regularization methods in image restoration
• Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
• The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
• Kronecker Product Approximations forImage Restoration with Reflexive Boundary Conditions
• An interior-point trust-region-based method for large-scale non-negative regularization