An interior-point method for large constrained discrete ill-posed problems
type: Item
instance of: scholarly article
title: An interior-point method for large constrained discrete ill-posed problems
zbMATH Open document ID: 1179.65045
published in: Journal of Computational and Applied Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 65F22
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5647948
zbMATH Keywords: ill-posed problem
zbMATH Keywords: regularization
zbMATH Keywords: box constraint
zbMATH Keywords: truncated iteration
zbMATH Keywords: conjugate gradient method
zbMATH Keywords: interior point method
zbMATH Keywords: numerical examples
author: Serena Morigi
author: Lothar Reichel
author: Fiorella Sgallari
describes a project that uses: CRAIG
describes a project that uses: LSQR
describes a project that uses: Regularization tools
describes a project that uses: HSL-VF05
MaRDI profile type: Publication
full work available at URL: j.cam.2008.02.018
OpenAlex ID: W2064157905
cites work: Q4296886
cites work: On Extrapolation Algorithms for Ordinary Initial Value Problems
cites work: The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis
cites work: The QR algorithm for unitary Hessenberg matrices
cites work: A divide and conquer method for unitary and orthogonal eigenproblems
cites work: On Least Squares Exponential Sum Approximation With Positive Coefficients
cites work: Optimal Error Bounds for the Newton–Kantorovich Theorem
cites work: Q4895893
cites work: Q4843158
cites work: An interior-point trust-region-based method for large-scale non-negative regularization
cites work: Tikhonov regularization with nonnegativity constraint
cites work: A nonnegatively constrained trust region algorithm for the restoration of images with an unknown blur
cites work: Q3843144
cites work: Non-negativity and iterative methods for ill-posed problems
cites work: Quasi-Newton approach to nonnegative image restorations
cites work: An iterative method for linear discrete ill-posed problems with box constraints
cites work: The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
cites work: Solving the Trust-Region Subproblem using the Lanczos Method
cites work: Gauss quadrature applied to trust region computations
cites work: Q4868585
cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
cites work: Methods of conjugate gradients for solving linear systems
cites work: Numerical Optimization
cites work: A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
cites work: Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
cites work: Tikhonov Regularization with a Solution Constraint
DOI: 10.1016/J.CAM.2008.02.018
Recommended article: Interior point methods for large-scale nonlinear programming
Recommended article: Q4952742
Recommended article: Interior-point methods for PDE-constrained optimization
Recommended article: Q5294040
Recommended article: An Interior Point Algorithm for Large-Scale Nonlinear Programming
Recommended article: An interior penalty approach to a large-scale discretized obstacle problem with nonlinear constraints
Recommended article: An interior point method for constrained saddle point problems
Recommended article: Inner solvers for interior point methods for large scale nonlinear programming
Recommended article: Inexact interior-point method for PDE-constrained nonlinear optimization
Recommended article: Discrete ill-posed least-squares problems with a solution norm constraint
description: scientific article; zbMATH DE number 5647948