An interior-point method for large constrained discrete ill-posed problems

DOI10.1016/j.cam.2008.02.018zbMath1179.65045MaRDI QIDQ1044857

Lothar Reichel, Serena Morigi, Fiorella Sgallari

Publication date: 15 December 2009

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.2008.02.018

zbMATH Keywords

regularization; numerical examples; conjugate gradient method; interior point method; ill-posed problem; box constraint; truncated iteration

Mathematics Subject Classification ID

65F22: Ill-posedness and regularization problems in numerical linear algebra

90C51: Interior-point methods

65F10: Iterative numerical methods for linear systems

Related Items

Solving trust-region subproblem augmented with linear inequality constraints, Modulus-based iterative methods for constrained Tikhonov regularization, A hybrid multilevel-active set method for large box-constrained linear discrete ill-posed problems, Conditional gradient Tikhonov method for a convex optimization problem in image restoration

Uses Software

• LSQR
• Regularization tools
• HSL-VF05
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A nonnegatively constrained trust region algorithm for the restoration of images with an unknown blur
• A divide and conquer method for unitary and orthogonal eigenproblems
• The QR algorithm for unitary Hessenberg matrices
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Gauss quadrature applied to trust region computations
• Quasi-Newton approach to nonnegative image restorations
• Tikhonov regularization with nonnegativity constraint
• An iterative method for linear discrete ill-posed problems with box constraints
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
• On Least Squares Exponential Sum Approximation With Positive Coefficients
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Numerical Optimization
• Tikhonov Regularization with a Solution Constraint
• Solving the Trust-Region Subproblem using the Lanczos Method
• Optimal Error Bounds for the Newton–Kantorovich Theorem
• An interior-point trust-region-based method for large-scale non-negative regularization
• On Extrapolation Algorithms for Ordinary Initial Value Problems
• The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
• Non-negativity and iterative methods for ill-posed problems
• Methods of conjugate gradients for solving linear systems