A reduced Newton method for constrained linear least-squares problems

DOI10.1016/j.cam.2009.10.006zbMath1186.65049OpenAlexW2048304654MaRDI QIDQ847169

Benedetta Morini, Margherita Porcelli, Raymond Honfu Chan

Publication date: 12 February 2010

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

zbMATH Keywords

image processingiterative methodNewton methodlocal quadratic convergenceactive set strategybound-constrained linear least-squares problems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (18)

An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ An optimal subgradient algorithm for large-scale bound-constrained convex optimization ⋮ Unified linear convergence of first-order primal-dual algorithms for saddle point problems ⋮ A partially inertial customized Douglas-Rachford splitting method for a class of structured optimization problems ⋮ Accelerated Uzawa methods for convex optimization ⋮ Hybrid variational model based on alternating direction method for image restoration ⋮ A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints ⋮ A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems ⋮ Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem ⋮ A modulus-based multigrid method for image retinex ⋮ Conditional gradient Tikhonov method for a convex optimization problem in image restoration ⋮ Dual–primal algorithm for linear optimization ⋮ Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks ⋮ On efficiency of nonmonotone Armijo-type line searches ⋮ On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints ⋮ POSITIVELY CONSTRAINED TOTAL VARIATION PENALIZED IMAGE RESTORATION ⋮ Approximate first-order primal-dual algorithms for saddle point problems ⋮ Variational image restoration with constraints on noise whiteness

Cites Work

• Nonlinear total variation based noise removal algorithms
• On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
• An affine-scaling interior-point CBB method for box-constrained optimization
• Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
• Interactive decision support in radiation therapy treatment planning
• An iterative method for linear discrete ill-posed problems with box constraints
• Computational experience with numerical methods for nonnegative least-squares problems
• Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
• A Fast Total Variation Minimization Method for Image Restoration
• An interior point Newton-like method for non-negative least-squares problems with degenerate solution
• Trust Region Methods
• A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
• An Introduction to Iterative Toeplitz Solvers
• Computing non-negative tensor factorizations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A reduced Newton method for constrained linear least-squares problems